Solving large scale crew scheduling problems
The crew pairing problem is posed as a set partitioning zero-one integer program. Variables are generated as legal pairings meeting all work rules. Dual values obtained from solving successive large linear program relaxations are used to prune the search tree. In this paper we present a graph based...
Saved in:
| Published in: | European journal of operational research Vol. 97; no. 2; pp. 260 - 268 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Amsterdam
Elsevier B.V
01.03.1997
Elsevier Elsevier Sequoia S.A |
| Series: | European Journal of Operational Research |
| Subjects: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!