Solving a continuous local access network design problem with a stabilized central column generation approach.
M. TrampontC. DestréAlain FayePublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- column generation
- network design problem
- branch and bound
- mixed integer programming
- exact solution
- integer program
- lagrangian relaxation
- valid inequalities
- set partitioning
- integer programming
- combinatorial optimization
- branch and bound algorithm
- lower bound
- optimal solution
- linear programming
- linear program
- search algorithm
- lp relaxation
- cutting plane
- linear programming relaxation
- constraint programming
- upper bound
- exact algorithms
- search space
- dual variables
- cutting plane algorithm
- np hard
- network design
- neural network
- traveling salesman problem
- transportation networks
- dynamic systems
- approximation algorithms
- simulated annealing
- dynamic programming
- reinforcement learning