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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.01.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116501956 / rank
 
Normal rank

Revision as of 22:28, 19 March 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
    0 references
    0 references
    0 references
    0 references