Worst-case analysis of two travelling salesman heuristics (Q786657): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4744064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for christofides' traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4191856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank

Latest revision as of 10:30, 14 June 2024

scientific article
Language Label Description Also known as
English
Worst-case analysis of two travelling salesman heuristics
scientific article

    Statements

    Worst-case analysis of two travelling salesman heuristics (English)
    0 references
    0 references
    0 references
    1984
    0 references
    symmetric travelling salesman problem
    0 references
    heuristics
    0 references
    worst-case performance
    0 references
    comparison of algorithms
    0 references

    Identifiers

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