Combinatorial Benders decomposition for the operational aircraft maintenance routing problem
From MaRDI portal
Publication:6551151
DOI10.1016/j.cor.2024.106545MaRDI QIDQ6551151
Publication date: 6 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
valid inequalitiesaircraft maintenance routingbranch-and-Benders-cutcombinatorial benders decompositionremaining flight hour
Cites Work
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
- A combinatorial Benders' decomposition for the lock scheduling problem
- Airline fleet assignment concepts, models, and algorithms
- The aircraft rotation problem
- The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- Combinatorial Benders cuts for assembly line balancing problems with setups
- The Benders decomposition algorithm: a literature review
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- Operational aircraft maintenance routing problem with remaining time consideration
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
- Dynamic aircraft recovery problem -- an operational decision support framework
- A branch-and-price approach for operational aircraft maintenance routing
- Generalized Benders decomposition
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
- Integration of turnaround and aircraft recovery to mitigate delay propagation in airline networks
- The Four-Day Aircraft Maintenance Routing Problem
- Flight String Models for Aircraft Fleeting and Routing
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Daily Aircraft Routing and Scheduling
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- The Aircraft Maintenance Routing Problem
This page was built for publication: Combinatorial Benders decomposition for the operational aircraft maintenance routing problem