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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently solvable special cases of bottleneck travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results and spectral techniques for combinatorial problems on circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Semidefinite Programming Relaxations of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2831331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman Problem in symmetric circulant matrices with two stripes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonian Toeplitz graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in circulant digraphs with two stripes / rank
 
Normal rank

Latest revision as of 13:55, 4 July 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
    semidefinite programming
    0 references
    traveling salesman problem
    0 references
    circulant matrices
    0 references
    0 references
    0 references
    0 references

    Identifiers