Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (Q2892348): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:33, 3 February 2024
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
