The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q215216
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andrew E. B. Lim / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.02.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964847870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / 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: Routing problems with loading constraints / 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: Local search with annealing-like restarts to solve the VRPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the pickup and delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and exact algorithms for the multi-pile vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3036721 / rank
 
Normal rank

Latest revision as of 05:49, 5 July 2024

scientific article
Language Label Description Also known as
English
The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
scientific article

    Statements

    The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    traveling salesman
    0 references
    pickup and delivery
    0 references
    last-in-first-out loading
    0 references
    tree data structure
    0 references
    variable neighborhood search
    0 references
    0 references
    0 references
    0 references
    0 references