Tools
Tools
Bell, D.E. (1973). A Group Cut for the Traveling Salesman Problem. IIASA Research Memorandum. IIASA, Laxenburg, Austria: RM-73-004
Preview |
Text
RM-73-004.pdf Download (318kB) | Preview |
Abstract
Held and Karp have shown how the good minimum spanning tree algorithm may be used in solving the Traveling Salesman problem by means of a generalized linear program involving l-trees. The size and structure of their dual problem are introduced. From this analysis a group cut is produced and methods by which this may resolve any duality gap are presented.
| Item Type: | Monograph (IIASA Research Memorandum) |
|---|---|
| Research Programs: | System and Decision Sciences - Core (SDS) |
| Depositing User: | IIASA Import |
| Date Deposited: | 15 Jan 2016 01:40 |
| Last Modified: | 27 Aug 2021 17:07 |
| URI: | https://pure.iiasa.ac.at/58 |
Actions (login required)
 |
View Item |