Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714900 / 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: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(90)90028-v / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063836932 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Analyzing the Held-Karp TSP bound: A monotonicity property with application
scientific article

    Statements

    Analyzing the Held-Karp TSP bound: A monotonicity property with application (English)
    0 references
    0 references
    0 references
    1990
    0 references
    lower bounds
    0 references
    approximation algorithms
    0 references
    performance guarantees
    0 references
    traveling salesman problem
    0 references

    Identifiers