Certification of an optimal TSP tour through 85,900 cities (Q1002076): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2008.09.006 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2008.09.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018660239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Travelling Salesman Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234150 / 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: A new class of cutting planes for the symmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem I: Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating a Superclass of Comb Inequalities in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2008.09.006 / rank
 
Normal rank

Latest revision as of 12:09, 10 December 2024

scientific article
Language Label Description Also known as
English
Certification of an optimal TSP tour through 85,900 cities
scientific article

    Statements

    Certification of an optimal TSP tour through 85,900 cities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2009
    0 references
    traveling salesman problem
    0 references
    integer programming
    0 references
    linear programming
    0 references
    0 references
    0 references

    Identifiers