2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture.
Saved in:
| Title: | 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture. |
|---|---|
| Authors: | Schalekamp, Frans1 frans@wm.edu.fransschalekamp.com, Williamson, David P.2 dpw@cs.cornell.edu, van Zuylen, Anke1 anke@wm.edu.ankevanzuylen.com |
| Source: | Mathematics of Operations Research (INFORMS). May2014, Vol. 39 Issue 2, p403-417. 15p. |
| Database: | Business Source Ultimate |
| ISSN: | 0364765X |
|---|---|
| DOI: | 10.1287/moor.2013.0608 |
