Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP. In particular, we compare subalgorithms for separating the cutting planes introduced by Hadjar...
Guardado en:
Autores principales: | Mounira Groiez, Guy Desaulniers, Ahmed Hadjar, Odile Marcotte |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2013
|
Materias: | |
Acceso en línea: | https://doaj.org/article/681475cce94b4a6ab9301d182c93da08 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
por: Dalia Attia, et al.
Publicado: (2019) -
Special issue on “Applied bilevel programming”
por: Patrice Marcotte, et al.
Publicado: (2015) -
Models for video-on-demand scheduling with costs
por: J.-Ch. Grégoire, et al.
Publicado: (2016) -
CP methods for scheduling and routing with time-dependent task costs
por: Elena Kelareva, et al.
Publicado: (2014) -
Integration of routing into a resource-constrained project scheduling problem
por: Philippe Lacomme, et al.
Publicado: (2019)