Solving a dial-a-flight problem using composite variables
From MaRDI portal
Recommendations
Cites work
- An exact algorithm for IP column generation
- An iterative approach to robust and integrated aircraft routing and crew scheduling
- Branch-and-price: Column generation for solving huge integer programs
- Composite Variable Formulations for Express Shipment Service Network Design
- Composite-variable modeling for service parts logistics
- Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem
- Flight schedule design for a charter airline
- Flight string models for aircraft fleeting and routing
- Integrated airline scheduling
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Modeling and solving an airline schedule generation problem
- Scheduling charter aircraft
- Solving the Dial-a-Ride problem using genetic algorithms
- The Continuous-Time Service Network Design Problem
- The aircraft rotation problem
This page was built for publication: Solving a dial-a-flight problem using composite variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307323)