Improving Christofides' lower bound for the traveling salesman problem (Q3698662): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Technical Note—Bounds for the Travelling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relation Between the Traveling-Salesman and the Longest-Path Problems / 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: Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of non-optimal arcs for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonoptimal Edges for the Symmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dual solutions of the linear assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank

Latest revision as of 19:26, 14 June 2024

scientific article
Language Label Description Also known as
English
Improving Christofides' lower bound for the traveling salesman problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references