Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
Year of publication: |
2013
|
---|---|
Authors: | Groiez, Mounira ; Desaulniers, Guy ; Hadjar, Ahmed ; Marcotte, Odile |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 1.2013, 3/4, p. 283-312
|
Subject: | Transportation scheduling | Multicommodity flow | Branch-and-cut algorithm | Tourenplanung | Vehicle routing problem | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
Jin, Bo, (2023)
-
A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Ozturk, Onur, (2017)
- More ...
-
Valid inequalities and separation algorithms for the set partitioning problem
Groiez, Mounira, (2014)
-
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
Hadjar, Ahmed, (2006)
-
Desaulniers, Guy, (2008)
- More ...