2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture (Q5169706)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture |
scientific article; zbMATH DE number 6316370
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture |
scientific article; zbMATH DE number 6316370 |
Statements
2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture (English)
0 references
11 July 2014
0 references
traveling salesman problem
0 references
subtour elimination
0 references
linear programming
0 references
integrality gap
0 references
2-matching
0 references
fractional 2-matching
0 references
