Combinatorial Benders decomposition for the operational aircraft maintenance routing problem.
Emine Es YurekPublished in: Comput. Oper. Res. (2024)
Keyphrases
- routing problem
- benders decomposition
- network design problem
- mixed integer
- vehicle routing problem
- exact algorithms
- continuous variables
- routing algorithm
- global optimization
- approximation algorithms
- network design
- travel time
- knapsack problem
- shortest path
- neural network
- traveling salesman problem
- lagrangian relaxation
- feasible solution
- branch and bound
- convex hull
- mixed integer programming
- lower bound
- objective function
- bayesian networks