A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 09:38, 30 January 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
    0 references
    0 references
    27 October 2011
    0 references
    0 references
    semidefinite programming
    0 references
    traveling salesman problem
    0 references
    circulant matrices
    0 references