The generalized fixed-charge network design problem.
Tommy ThomadsenThomas R. StidsenPublished in: Comput. Oper. Res. (2007)
Keyphrases
- network design problem
- fixed charge
- network flow problem
- network design
- valid inequalities
- approximation algorithms
- branch and bound
- mixed integer
- communication networks
- minimal cost
- integer programming
- transportation problem
- mixed integer programming
- network flow
- traveling salesman problem
- network architecture
- np hard
- feasible solution
- transportation networks
- linear programming
- branch and bound algorithm
- lagrangian relaxation
- upper bound