Symmetric weight constrained traveling salesman problem: Local search (Q535615): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s12597-010-0028-8 / 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: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP heuristics: domination analysis and complexity / 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: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S12597-010-0028-8 / rank
 
Normal rank

Latest revision as of 20:49, 9 December 2024

scientific article
Language Label Description Also known as
English
Symmetric weight constrained traveling salesman problem: Local search
scientific article

    Statements

    Symmetric weight constrained traveling salesman problem: Local search (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2011
    0 references
    local search heuristic
    0 references
    1-tree lower bound
    0 references
    Lagrangian relaxation
    0 references
    subsgradient maximization
    0 references

    Identifiers