Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
From MaRDI portal
Recommendations
- Solving large airline crew scheduling problems: Random pairing generation and strong branching
- scientific article; zbMATH DE number 2227477
- Airline crew pairing optimization
- Column generation and the airline crew pairing problem
- A new approach for crew pairing problems by column generation with an application to air transportation
Cites work
- scientific article; zbMATH DE number 1452994 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- A Primer in Column Generation
- A branch-and-price heuristic for the crew pairing problem with language constraints
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- A new approach for crew pairing problems by column generation with an application to air transportation
- A new heuristic branching scheme for the crew pairing problem with base constraints
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- Airline crew scheduling: state-of-the-art
- An approximate model and solution approach for the long-haul crew pairing problem
- An improved primal simplex algorithm for degenerate linear programs
- An integer programming approach to generating airline crew pairings
- Bi-dynamic constraint aggregation and subproblem reduction
- Branch-and-price: Column generation for solving huge integer programs
- Column Generation
- Crew pairing at Air France
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Dynamic constraint and variable aggregation in column generation
- Integral simplex using decomposition for the set partitioning problem
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Solving large airline crew scheduling problems: Random pairing generation and strong branching
- Solving large scale crew scheduling problems
Cited in
(3)
This page was built for publication: Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226471)