| Author: | Hoffman, K. Padberg, M. |
| Title: | Solving airline crew scheduling problems by branch-and-cut |
| Journal: | Management Science
1993 : JUN, VOL. 39:6, p. 657-682 |
| Index terms: | SCHEDULING HEURISTIC METHODS AIRLINES |
| Language: | eng |
| Abstract: | The authors present a branch-and-cut approach to solving to proven optimally large set partitioning problems arising within the airline industry. The authors first provide some background related to this important application and then describe the approach for solving representative problems in this problem class. The branch-and-cut solver generates cutting planes based on the underlying structure of the polytope defined by the convex hull of the feasible integer points and incorporates these cuts into a tree-search algorithm that uses automatic reformulation procedures, heurictics and linear programming technology to assist in the solution. |
SCIMA