Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / 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.cor.2015.04.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2216725884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Models and Algorithms for One-to-One Pickup and Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for the double TSP with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to the double travelling salesman problem with multiple stacks / 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 adapted heuristic approach for a clustered traveling salesman problem with loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New neighborhood structures for the double traveling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / 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: A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing problems with loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of combined routing and loading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Multiple Stack TSP, kSTSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the double traveling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank

Latest revision as of 23:55, 12 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for the double vehicle routing problem with multiple stacks
scientific article

    Statements

    Exact algorithms for the double vehicle routing problem with multiple stacks (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    vehicle routing problem
    0 references
    one-to-one pickup-and-delivery
    0 references
    last-in-first-out
    0 references
    branch-and-cut
    0 references
    branch-and-price-and-cut
    0 references
    0 references
    0 references

    Identifiers