Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP (Q2183196)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7204105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP |
scientific article; zbMATH DE number 7204105 |
Statements
Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP (English)
0 references
26 May 2020
0 references
traveling salesman problem
0 references
subtour LP
0 references
matrix-tree theorem
0 references
SDP relaxation
0 references
0 references
0 references
0.7869742512702942
0 references
0.7818259000778198
0 references
0.7746153473854065
0 references
0.7686830759048462
0 references
