Upper bounds for single-source uncapacitated concave minimum-cost network flow problems.
Dalila B. M. M. FontesEleni HadjiconstantinouNicos ChristofidesPublished in: Networks (2003)
Keyphrases
- network flow problem
- single source
- upper bound
- minimum cost
- fixed charge
- lower bound
- np hard
- capacity constraints
- network design problem
- approximation algorithms
- objective function
- branch and bound
- network flow
- network simplex algorithm
- shortest path problem
- worst case
- multi source
- branch and bound algorithm
- minimum cost flow
- lower and upper bounds
- special case
- minimal cost
- network design
- linear program
- multistage
- shortest path