Crew pairing at Air France
From MaRDI portal
Publication:1278613
DOI10.1016/S0377-2217(96)00195-6zbMath0944.90040OpenAlexW2008522454MaRDI QIDQ1278613
S. Marc, B. Rioux, Marius M. Solomon, François Soumis, Yvan Dumas, Guy Desaulniers, Jacques Desrosiers
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00195-6
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90) Dynamic programming (90C39)
Related Items
Approximation of the Clustered Set Covering Problem, Distributed integral column generation for set partitioning problems, A new heuristic branching scheme for the crew pairing problem with base constraints, Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price, Application of a hybrid genetic algorithm to airline crew scheduling, Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem, Duty-period-based network model for crew rescheduling in European airlines, Dynamic constraint and variable aggregation in column generation, Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling, Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods, Modeling and solving a crew assignment problem in air transportation, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes, Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems, Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming., Staff scheduling and rostering: a review of applications, methods and models., Dynamic constraint aggregation for solving very large-scale airline crew pairing problems, A note on the clustered set covering problem, Integrated airline scheduling, A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation, Solving shortest path problems with a weight constraint and replenishment arcs, A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints, An enhanced rostering model for airline crews, Integral simplex using double decomposition for set partitioning problems, Airline cockpit crew scheduling, Optimal routing with failure-independent path protection, Optimal construction of airline individual crew pairings., A branch-and-price heuristic for the crew pairing problem with language constraints, Locomotive assignment with heterogeneous consists at CN North America, An iterative approach to robust and integrated aircraft routing and crew scheduling, Stabilized column generation, A network model for airline cabin crew scheduling, A set covering approach for multi-depot train driver scheduling, The robust crew pairing problem: model and solution methodology, Airline crew scheduling: state-of-the-art
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach for crew pairing problems by column generation with an application to air transportation
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Flight Crew Scheduling
- The Column Generation Principle And The Airline Crew Scheduling Problem
- Deadhead Selection for the Long-Haul Crew Pairing Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
