Graph sparsification for the Vehicle Routing Problem with Time windows
| Year of publication: |
2011
|
|---|---|
| Authors: | Doppstadt, Christian ; Schneider, Michael ; Stenger, Andreas ; Sand, Bastian ; Vigo, Daniele |
| Published in: |
Operations research proceedings 2010 : selected papers of the annual International Conference of the German Operations Research Society (GOR) at Universität der Bundeswehr München, September 1 - 3, 2010. - Berlin : Springer, ISBN 3-642-20008-7. - 2011, p. 227-232
|
| Subject: | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory | Operations Research | Operations research |
-
The multiple shortest path problem with path deconfliction
Hughes, Michael S., (2021)
-
Operation of shunting yards : train-to-yard assignment problem
Otto, Alena, (2017)
-
A reoptimization algorithm for the shortest path problem with time windows
Desrochers, Martin, (1988)
- More ...
-
A note on the time travel approach for handling time windows in vehicle routing problems
Schneider, Michael, (2013)
-
Location routing for small package shippers with subcontracting options
Stenger, Andreas, (2012)
-
Territory-based vehicle routing in the presence of time-window constraints
Schneider, Michael, (2015)
- More ...