Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows

DOI10.3138/INFOR.48.1.053MaRDI QIDQ6160235zbMATH OpenFDO

Authors Simon Spoorendonk, Guy Desaulniers

Publication date 9 May 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3138/INFOR.48.1.053

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Path inequalities for the vehicle routing problem with time windows
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• scientific article; zbMATH DE number 4047423
• A GRASP for the Vehicle Routing Problem with Time Windows
• Formulations and exact algorithms for the vehicle routing problem with time windows
• Approximation schemes for Euclidean vehicle routing problems with time windows
• The vehicle routing problem with coupled time windows
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• scientific article; zbMATH DE number 3892967

Cites work

• 2-path cuts for the vehicle routing problem with time windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Branch-and-price: Column generation for solving huge integer programs
• Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Decomposition Principle for Linear Programs
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1452994 (Why is no real title available?)
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• On the facial structure of set packing polyhedra
• On the membership problem for the elementary closure of a polyhedron
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• The shortest-path problem with resource constraints and k-cycle elimination for k 3
• Vehicle routing problem with elementary shortest path based column generation
• Vehicle Routing Problem with Time Windows

Cited in

(6)

• Limited memory rank-1 cuts for vehicle routing problems
• Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
• A branch-and-cut algorithm for the capacitated profitable tour problem
• Consistency cuts for Dantzig-Wolfe reformulations
• A scheme for determining vehicle routes based on Arc-based service network design
• Subset-row inequalities and unreachability in path-based formulations for vehicle routing and scheduling problems

This page was built for publication: Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160235)