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

DOI10.1023/A:1011223523191zbMath0983.90041MaRDI QIDQ5946770

Diego Klabjan, Ellis L. Johnson, Srini Ramaswamy, Eric Gelman, Nemhauser, George I.

Publication date: 7 April 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011223523191

zbMATH Keywords

transportation; branch and bound; airline crew scheduling; linear programming relaxation; integer program; linear programming based heuristic; random pairing

Mathematics Subject Classification ID

90C06: Large-scale problems in mathematical programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C05: Linear programming

90B35: Deterministic scheduling theory in operations research

Related Items

Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded, Disruption management in flight gate scheduling, Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods, Hooked on IP, Airline crew scheduling: state-of-the-art, Improving airline operational performance through schedule perturbation, Duty-period-based network model for crew rescheduling in European airlines, An integer programming approach to generating airline crew pairings, A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen, A new heuristic branching scheme for the crew pairing problem with base constraints, Dynamic constraint aggregation for solving very large-scale airline crew pairing problems, Integral simplex using double decomposition for set partitioning problems, The robust crew pairing problem: model and solution methodology, A new modeling and solution approach for the set-partitioning problem