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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2013
|
| Subjects: | |
| Online Access: | https://doaj.org/article/681475cce94b4a6ab9301d182c93da08 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|