Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the asymmetric traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problem with elementary shortest path based column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the first Chvátal closure / 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: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path inequalities for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian duality applied to the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Path Cuts for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability cuts for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows / rank
 
Normal rank

Revision as of 21:39, 12 July 2024

scientific article
Language Label Description Also known as
English
Lifted and local reachability cuts for the vehicle routing problem with time windows
scientific article

    Statements

    Lifted and local reachability cuts for the vehicle routing problem with time windows (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    vehicle routing problem with time windows
    0 references
    mixed integer programming
    0 references
    branch and cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references