A note on "a dual-ascent approach to the fixed-charge capacitated network design problem".
Bernard GendronPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- network design problem
- fixed charge
- network flow problem
- network design
- valid inequalities
- primal dual
- approximation algorithms
- branch and bound
- linear programming
- mixed integer
- minimal cost
- integer programming
- transportation networks
- communication networks
- mixed integer programming
- transportation problem
- network architecture
- traveling salesman problem
- exact solution
- cutting plane
- lower and upper bounds
- special case
- column generation
- minimum cost
- convex optimization
- feasible solution
- dynamic programming