Bibliographic Details
| Title: |
Layers and matroids for the traveling salesman's paths. |
| Authors: |
Schalekamp, Frans1 fms9@cornell.edu, Sebő, András2 andras.sebo@grenoble-inp.fr, Traub, Vera1,3 traub@or.uni-bonn.de, van Zuylen, Anke4 anke@wm.edu |
| Source: |
Operations Research Letters. Jan2018, Vol. 46 Issue 1, p60-63. 4p. |
| Subjects: |
Layers (Computer graphics), Matroids, Linear programming, Polyhedral functions, Spanning trees |
| Abstract: |
Abstract Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive "generalized Gao-trees". We give a short proof of this fact, as a layered convex combination of bases of a sequence of increasingly restrictive matroids. A strongly polynomial, combinatorial algorithm follows for finding this convex combination, which is a new tool offering polyhedral insight, already instrumental in recent results for the s − t path TSP. [ABSTRACT FROM AUTHOR] |
|
Copyright of Operations Research Letters is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
