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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sumit K. Garg / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4131982 / rank
 
Normal rank
Property / zbMATH Keywords
 
fast diagonal completion algorithm
Property / zbMATH Keywords: fast diagonal completion algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
travelling salesman
Property / zbMATH Keywords: travelling salesman / rank
 
Normal rank
Property / zbMATH Keywords
 
2-optimal method
Property / zbMATH Keywords: 2-optimal method / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest 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