Pruning in column generation for service vehicle dispatching
From MaRDI portal
Publication:940899
DOI10.1007/s10479-007-0275-0zbMath1153.90378DBLPjournals/anor/WestphalK08OpenAlexW1964988973WikidataQ57851478 ScholiaQ57851478MaRDI QIDQ940899
Stephan Westphal, Sven O. Krumke
Publication date: 3 September 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0275-0
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Queues and service in operations research (90B22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact algorithm for IP column generation
- Flight String Models for Aircraft Fleeting and Routing
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Selected Topics in Column Generation
- Combinatorial optimization. Theory and algorithms
This page was built for publication: Pruning in column generation for service vehicle dispatching