The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs.
Hoang TuySaied GhannadanAthanasios MigdalasPeter VärbrandPublished in: J. Glob. Optim. (1995)
Keyphrases
- network flow problem
- minimum cost
- minimal cost
- fixed charge
- multi commodity
- np hard
- network flow
- network simplex algorithm
- approximation algorithms
- total cost
- expected cost
- mixed integer
- minimum cost flow
- objective function
- neural network
- branch and bound algorithm
- feasible solution
- shortest path
- worst case
- network design problem
- lower bound
- optimal solution