Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints.
Tolga BektasMervat ChoumanTeodor Gabriel CrainicPublished in: Networks (2010)
Keyphrases
- network design problem
- approximation algorithms
- network design
- computational complexity
- mixed integer
- worst case
- network flow problem
- mixed integer programming
- branch and bound
- computationally expensive
- feasible solution
- integer programming
- lower and upper bounds
- linear program
- approximate solutions
- upper bound
- dynamic programming