Complexity of column generation in network design with path-based survivability mechanisms.
Sebastian OrlowskiMichal PióroPublished in: Networks (2012)
Keyphrases
- network design
- column generation
- communication networks
- branch and bound
- linear programming
- linear program
- integer programming
- vehicle routing
- network design problem
- optimal solution
- set partitioning
- integer program
- integer linear programming
- lagrangean relaxation
- cutting plane
- mixed integer programming
- constraint programming
- network architecture
- computational complexity
- exact solution
- bi objective
- lagrangian relaxation
- linear programming relaxation
- valid inequalities
- special case
- vehicle routing problem with time windows
- dantzig wolfe decomposition
- genetic algorithm
- search space
- np complete