Minimal-cost network flow problems with variable lower bounds on arc flows.
Xiaoyan ZhuQi YuanAlberto Garcia-DiazLiang DongPublished in: Comput. Oper. Res. (2011)
Keyphrases
- network flow problem
- minimal cost
- lower bound
- network simplex algorithm
- network design problem
- upper bound
- feasible solution
- endpoints
- np hard
- branch and bound
- minimum cost
- objective function
- branch and bound algorithm
- optimal solution
- lagrangian relaxation
- network flow
- worst case
- lower and upper bounds
- dynamic systems
- high dimensional