Arcs-states models for the vehicle routing problem with time windows and related problems
From MaRDI portal
Publication:856684
DOI10.1016/J.COR.2005.05.024zbMATH Open1102.90014OpenAlexW1997194016MaRDI QIDQ856684FDOQ856684
Authors: Thierry Mautor, Edith Naudin 
Publication date: 7 December 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.024
Recommendations
- Vehicle Routing Problem with Time Windows
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- Vehicle Routing with Time Windows
- A column generation algorithm for the vehicle routing problem with soft time windows
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- 2-path cuts for the vehicle routing problem with time windows
- Routing with time windows by column generation
- A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem
Cited In (1)
This page was built for publication: Arcs-states models for the vehicle routing problem with time windows and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856684)
