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 | Terminplanung | Time scheduling |
-
Branch-and-refine for solving time-expanded MILP formulations
Gnegel, Fabian, (2023)
-
Formal verification of UML2 timing diagrams based on Time Petri Nets
Louati, Aymen, (2016)
-
Petri-Netze zur dynamischen Modellierung des Investitionsprozesses
Huch, Burkhard, (2000)
- More ...
-
A note on the time travel approach for handling time windows in vehicle routing problems
Schneider, Michael, (2013)
-
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)
- More ...