A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021)

From MaRDI portal
Revision as of 14:55, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references