Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks.
Rainer E. BurkardHelidon DollaniPhan Thien ThachPublished in: J. Glob. Optim. (2001)
Keyphrases
- network flow problem
- minimum cost
- single source
- fixed charge
- np hard
- dynamic programming
- network design
- minimal cost
- network design problem
- shortest path problem
- network flow
- approximation algorithms
- multi source
- transportation problem
- lagrangian relaxation
- linear programming
- scheduling problem
- lower bound
- integer programming
- optimal solution
- fixed cost
- reinforcement learning
- knapsack problem
- greedy algorithm
- computational complexity
- communication networks
- branch and bound algorithm
- multistage
- data fusion
- worst case
- facility location
- special case
- social networks