The robust crew pairing problem: model and solution methodology

DOI10.1007/s10898-014-0222-yzbMath1329.90165MaRDI QIDQ2350073

Da Lu, Fatma Gzara

Publication date: 18 June 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0222-y

zbMATH Keywords

Lagrangian relaxation; robust optimization; airline operations; robust shortest path; crew pairing

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C47: Minimax problems in mathematical programming

Related Items

The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach, A utility theory based interactive approach to robustness in linear optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling
• Robust crew pairing for managing extra flights
• An iterative approach to robust and integrated aircraft routing and crew scheduling
• A new approach for crew pairing problems by column generation with an application to air transportation
• Crew pairing at Air France
• Robust solutions of uncertain linear programs
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Project scheduling under uncertainty: survey and research potentials
• Robust Convex Optimization
• A New Pricing Scheme for Airline Crew Scheduling
• The Price of Robustness
• Introduction to Stochastic Programming
• Airline Crew Scheduling with Regularity
• Constructing robust crew schedules with bicriteria optimization
• Deadhead Selection for the Long-Haul Crew Pairing Problem
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Solving large airline crew scheduling problems: Random pairing generation and strong branching