A new heuristic branching scheme for the crew pairing problem with base constraints
From MaRDI portal
Publication:1652206
DOI10.1016/j.cor.2016.11.020zbMath1391.90305OpenAlexW2557491000MaRDI QIDQ1652206
Guy Desaulniers, François Soumis, Frédéric Quesnel
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.11.020
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Dynamic constraint aggregation for solving very large-scale airline crew pairing problems ⋮ A branch-and-price heuristic for the crew pairing problem with language constraints
Cites Work
- The shortest path problem with forbidden paths
- On an exact method for the constrained shortest path problem
- Airline crew scheduling: state-of-the-art
- A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases
- An integrated aircraft routing, crew scheduling and flight retiming model
- Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem
- A new approach for crew pairing problems by column generation with an application to air transportation
- Column generation and the airline crew pairing problem
- Crew pairing at Air France
- Computational results with a primal-dual subproblem simplex method
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Column Generation based Primal Heuristics
- Column Generation
- Shortest Path Problems with Resource Constraints
- Solving large airline crew scheduling problems: Random pairing generation and strong branching
This page was built for publication: A new heuristic branching scheme for the crew pairing problem with base constraints
