A heuristic for the pickup and delivery traveling salesman problem (Q1571039): 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: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem with backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the traveling salesman problem with pickup and delivery customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of local search algorithms for constrained routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new extension of local search applied to the Dial-A-Ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-interchange procedures for local search in a precedence-constrained routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(99)00066-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061233155 / rank
 
Normal rank

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
A heuristic for the pickup and delivery traveling salesman problem
scientific article

    Statements

    A heuristic for the pickup and delivery traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    9 July 2000
    0 references
    improvement procedure
    0 references
    pickup and delivery traveling salesman problem
    0 references
    heuristics
    0 references

    Identifiers