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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Mounira Groiez, Guy Desaulniers, Ahmed Hadjar, Odile Marcotte
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2013
Materias:	Transportation scheduling Multicommodity flow Branch-and-cut algorithm Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/681475cce94b4a6ab9301d182c93da08
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Sea el primero en dejar un comentario!

Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem

Ejemplares similares