New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796)
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 6668148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New semidefinite programming relaxations for the linear ordering and the traveling salesman problem |
scientific article; zbMATH DE number 6668148 |
Statements
New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (English)
0 references
22 December 2016
0 references
linear ordering problem
0 references
max cut problem
0 references
traveling salesman problem
0 references
target visitation problem
0 references
vertex ordering problems
0 references
semidefinite programming
0 references
approximation algorithms
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8453458547592163
0 references
0.829724907875061
0 references
0.8028955459594727
0 references
0.802208662033081
0 references
