A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A man-machine approach toward solving the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Traveling Salesman Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Large-scale Travelling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Approaches to Solving the Traveling Salesman Problem / rank
 
Normal rank

Revision as of 12:58, 20 June 2024

scientific article
Language Label Description Also known as
English
A diagonal completion and 2-optimal procedure for the travelling salesman problem
scientific article

    Statements

    A diagonal completion and 2-optimal procedure for the travelling salesman problem (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    fast diagonal completion algorithm
    0 references
    travelling salesman
    0 references
    2-optimal method
    0 references