A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems.
Dalila B. M. M. FontesEleni HadjiconstantinouNicos ChristofidesPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- network flow problem
- minimum cost
- single source
- fixed charge
- dynamic programming
- network design problem
- network flow
- network simplex algorithm
- np hard
- capacity constraints
- shortest path problem
- minimal cost
- multi source
- approximation algorithms
- lagrangian relaxation
- mixed integer
- objective function
- minimum cost flow
- lot sizing
- state space
- evolutionary algorithm
- linear program
- optimal policy
- shortest path