Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (Q2892348)
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: Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) |
scientific article |
Statements
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (English)
0 references
18 June 2012
0 references
combinatorial optimization
0 references
traveling salesman
0 references
\texttt{TSPLIB}
0 references
cutting-plane algorithm
0 references
