Truly tight bounds for TSP heuristics (Q6047697): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower Bounds for Insertion Methods for TSP / 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: Q4191856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nearest neighbor rule for the metric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nearest neighbor rule for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank

Latest revision as of 20:26, 2 August 2024

scientific article; zbMATH DE number 7736829
Language Label Description Also known as
English
Truly tight bounds for TSP heuristics
scientific article; zbMATH DE number 7736829

    Statements

    Truly tight bounds for TSP heuristics (English)
    0 references
    0 references
    12 September 2023
    0 references
    TSP-heuristics
    0 references
    worst-case analysis
    0 references
    matching bounds
    0 references

    Identifiers

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