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...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2013
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/681475cce94b4a6ab9301d182c93da08 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|