Estimating the Held-Karp lower bound for the geometric TSP (Q1291588): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / 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: Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem / 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: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / 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/s0377-2217(96)00214-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020993691 / rank
 
Normal rank

Latest revision as of 09:28, 30 July 2024

scientific article
Language Label Description Also known as
English
Estimating the Held-Karp lower bound for the geometric TSP
scientific article

    Statements

    Estimating the Held-Karp lower bound for the geometric TSP (English)
    0 references
    0 references
    21 November 2000
    0 references
    travelling salesman
    0 references
    Held-Karp lower bound
    0 references
    minimum 1-tree
    0 references
    Lagrangian relaxation
    0 references
    subgradient optimization
    0 references

    Identifiers