Solving large airline crew scheduling problems: Random pairing generation and strong branching

Computational Optimization and Applications

Volumn 20, Issue 1, 2001, Pages 73-91

  Klabjan, Diego ^a   Johnson, Ellis L ^a   Nemhauser, George L ^a   Gelman, Eric ^b   Ramaswamy, Srini ^b  

^a Georgia Institute of Technology   (United States)

^b Research and Development

Author keywords

Airline crew scheduling; Branch and bound; Transportation

Indexed keywords

AIR TRANSPORTATION; ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MARKOV PROCESSES; SCHEDULING;

AIRLINE CREW SCHEDULING;

PROBLEM SOLVING;

EID: 0035479870     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011223523191     Document Type: Article

References (24)

1. Column generation, and the airline crew pairing problem
2. Recent advances in crew pairing optimization at American airlines
3. A global approach to crew pairing optimization
4. Crew pairing optimization
5. Branch-and-price: Column generation for solving huge integer programs
6. Crew scheduling
7. Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables
8. Very large-scale linear programming: A case study in combining interior point, and simplex methods
9. Solving large scale crew scheduling problems
10. A probabilistic heuristic for a computationally difficult set covering problem
11. Optimizing flight crew schedules
12. A parallel primal-dual algorithm
13. A computational study of search strategies for mixed integer programming
14. An integer programming approach to scheduling