Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation.
Alberto CapraraPublished in: ATMOS (2010)
Keyphrases
- combinatorial optimization
- column generation
- lagrangian relaxation
- branch and bound
- branch and bound algorithm
- combinatorial optimization problems
- traveling salesman problem
- mixed integer programming
- metaheuristic
- simulated annealing
- integer program
- exact solution
- integer programming
- combinatorial problems
- optimization problems
- linear programming
- cutting plane
- set covering problem
- set partitioning
- vehicle routing problem
- relaxation algorithm
- exact algorithms
- valid inequalities
- single machine scheduling problem
- optimal solution
- linear programming relaxation
- vehicle routing problem with time windows
- linear programming problems
- set covering
- linear program
- heuristic search
- memetic algorithm
- cutting plane algorithm
- tabu search
- search algorithm