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

DOI10.1023/A:1011223523191zbMath0983.90041OpenAlexW1521523146MaRDI 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

transportationbranch and boundairline crew schedulinglinear programming relaxationinteger programlinear programming based heuristicrandom pairing

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (14)

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 ⋮ Improving airline operational performance through schedule perturbation ⋮ Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded ⋮ Duty-period-based network model for crew rescheduling in European airlines ⋮ Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods ⋮ Dynamic constraint aggregation for solving very large-scale airline crew pairing problems ⋮ A new modeling and solution approach for the set-partitioning problem ⋮ An integer programming approach to generating airline crew pairings ⋮ Hooked on IP ⋮ Disruption management in flight gate scheduling ⋮ Integral simplex using double decomposition for set partitioning problems ⋮ The robust crew pairing problem: model and solution methodology ⋮ Airline crew scheduling: state-of-the-art

This page was built for publication: Solving large airline crew scheduling problems: Random pairing generation and strong branching