Ring Network Design by Lagrangean Based Column Generation.
Mathias HenningssonKaj HolmbergMikael RönnqvistPeter VärbrandPublished in: Telecommun. Syst. (2002)
Keyphrases
- network design
- column generation
- lagrangean relaxation
- branch and bound
- linear programming
- set covering problem
- network design problem
- linear program
- integer programming
- communication networks
- vehicle routing
- integer program
- mixed integer programming
- constraint programming
- optimal solution
- lagrangian relaxation
- set covering
- network architecture
- set partitioning
- cutting plane
- vehicle routing problem with time windows
- facility location
- bi objective
- exact solution
- linear programming relaxation
- valid inequalities
- grasp with path relinking
- branch and bound algorithm
- constraint satisfaction problems
- search space
- search algorithm