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; zbMATH DE number 6047455
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing with domino-parity inequalities for the traveling salesman problem (TSP) |
scientific article; zbMATH DE number 6047455 |
Statements
18 June 2012
0 references
combinatorial optimization
0 references
traveling salesman
0 references
\texttt{TSPLIB}
0 references
cutting-plane algorithm
0 references
Computing with domino-parity inequalities for the traveling salesman problem (TSP) (English)
0 references
