On Semidefinite Programming Relaxations of the Traveling Salesman Problem (Q3648520): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56874368, #quickstatements; #temporary_batch_1710982311091 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 0902.1843 / rank | |||
Normal rank | |||
Latest revision as of 18:12, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Semidefinite Programming Relaxations of the Traveling Salesman Problem |
scientific article |
Statements
On Semidefinite Programming Relaxations of the Traveling Salesman Problem (English)
0 references
27 November 2009
0 references
semidefinite programming
0 references
combinational optimization
0 references
