A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem
Year of publication: |
January 2018
|
---|---|
Authors: | Dalmeijer, Kevin ; Spliet, Remy |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 89.2018, p. 140-152
|
Subject: | Vehicle Routing | Time window assignment | Precedence inequalities | Tourenplanung | Vehicle routing problem | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
A neural separation algorithm for the rounded capacity inequalities
Kim, Hyeonah, (2024)
-
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Desaulniers, Guy, (2020)
-
An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints
Côté, Jean-François, (2014)
- More ...
-
A branch-and-cut algorithm for the time window assignment vehicle routing problem
Dalmeijer, Kevin, (2016)
-
Dynamic time window adjustment
Dalmeijer, Kevin, (2019)
-
Lee, Chungjae, (2024)
- More ...