A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems.
Bruce W. LamarYosef SheffiWarren B. PowellPublished in: Oper. Res. (1990)
Keyphrases
- fixed charge
- network design problem
- network flow problem
- lower bound
- branch and bound
- network design
- valid inequalities
- lower and upper bounds
- lagrangian relaxation
- np hard
- upper bound
- mixed integer programming
- capacity expansion
- fixed cost
- branch and bound algorithm
- approximation algorithms
- minimal cost
- minimum cost
- network flow
- worst case
- optimal solution
- cutting plane
- transportation problem
- integer programming
- mixed integer
- column generation
- search algorithm
- exact solution
- network architecture
- communication networks
- transportation networks
- constraint satisfaction problems
- capacity planning
- objective function
- neural network
- traveling salesman problem
- linear programming
- search space