Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (Q2892348): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56067406, #quickstatements; #temporary_batch_1712688784189 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56067406 / rank | |||
Normal rank | |||
Revision as of 21:15, 9 April 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
