Set covering heuristics in a Benders decomposition for railway timetabling.
Florin LeutwilerFrancesco CormanPublished in: Comput. Oper. Res. (2023)
Keyphrases
- set covering
- benders decomposition
- exact algorithms
- network design problem
- integer programming
- set covering problem
- constraint programming
- column generation
- timetabling problem
- combinatorial problems
- mixed integer
- exact solution
- knapsack problem
- mixed integer programming
- approximation algorithms
- heuristic methods
- combinatorial auctions
- valid inequalities
- nonlinear programming
- lagrangian relaxation
- max sat
- search strategies
- linear programming
- integer program
- linear program
- combinatorial optimization
- search algorithm
- combinatorial optimization problems
- constraint satisfaction
- cutting plane
- heuristic search
- upper bound
- dynamic programming
- evolutionary algorithm