A restricted Lagrangean approach to the traveling salesman problem (Q3911684): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cutting planes from conditional bounds: A new approach to set covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Travelling Salesman and Assignment Problems: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Hamiltonian Chain of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Bounds for the Travelling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3205014 / 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: Combinatorial Optimization: What is the State of the Art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW PRACTICAL SOLUTION FOR LARGE-SCALE TRAVELING SALESMAN PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138484 / rank
 
Normal rank

Revision as of 12:21, 13 June 2024

scientific article
Language Label Description Also known as
English
A restricted Lagrangean approach to the traveling salesman problem
scientific article

    Statements

    A restricted Lagrangean approach to the traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    asymmetric traveling salesman
    0 references
    restricted Lagrangean relaxation
    0 references
    assignment problem
    0 references
    polynomially bounded procedures
    0 references
    computational experience
    0 references
    2-matching problem
    0 references
    branch and bound
    0 references
    Hamiltonian circuits
    0 references
    arc premiums
    0 references