On lower bounds for the fixed charge problem.
Veena AdlakhaKrzysztof KowalskiPublished in: Comput. Oper. Res. (2014)
Keyphrases
- fixed charge
- lower bound
- transportation problem
- network design
- network flow problem
- upper bound
- valid inequalities
- lower and upper bounds
- np hard
- capacity expansion
- branch and bound algorithm
- integer programming
- cutting plane
- fixed cost
- branch and bound
- objective function
- optimal solution
- worst case
- minimum cost
- network design problem
- communication networks
- minimal cost
- special case
- production planning
- mixed integer
- network architecture
- shortest path
- state space
- bayesian networks