An integer programming approach to generating airline crew pairings
From MaRDI portal
Publication:958462
DOI10.1016/j.cor.2008.02.001zbMath1162.90520OpenAlexW2050446204WikidataQ125317305 ScholiaQ125317305MaRDI QIDQ958462
Marshall Weir, Shervin AhmadBeygi, Amy Mainville Cohn
Publication date: 4 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.02.001
Related Items (3)
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 ⋮ Optimal Maintenance Scheduling of N-Vehicles with Time-Varying Reward Functions and Constrained Maintenance Decisions
Cites Work
- A new approach for crew pairing problems by column generation with an application to air transportation
- On the integer properties of scheduling set partitioning models
- Handbook of transportation science.
- A network model for airline cabin crew scheduling
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A New Pricing Scheme for Airline Crew Scheduling
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- An Algorithm for Large Set Partitioning Problems
- Set Partitioning: A survey
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Deadhead Selection for the Long-Haul Crew Pairing Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Optimal Political Districting by Implicit Enumeration Techniques
- Solving large airline crew scheduling problems: Random pairing generation and strong branching
- Constraint programming based column generation for crew assignment
This page was built for publication: An integer programming approach to generating airline crew pairings
