A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: YALMIP / rank | |||
Normal rank | |||
Revision as of 07:28, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of lower bounds for the symmetric circulant traveling salesman problem |
scientific article |
Statements
A comparison of lower bounds for the symmetric circulant traveling salesman problem (English)
0 references
27 October 2011
0 references
semidefinite programming
0 references
traveling salesman problem
0 references
circulant matrices
0 references
