Approximate solutions of capacitated fixed-charge minimum cost network flow problems.
Do Ba KhangOkitsugu FujiwaraPublished in: Networks (1991)
Keyphrases
- approximate solutions
- network flow problem
- minimum cost
- np hard
- network design problem
- approximation algorithms
- exact solution
- network simplex algorithm
- integer programming
- np complete
- network flow
- optimal solution
- scheduling problem
- special case
- lower bound
- branch and bound
- branch and bound algorithm
- valid inequalities
- worst case
- computational complexity
- lagrangian relaxation
- network design
- linear programming
- knapsack problem
- primal dual
- minimum cost flow
- transportation networks
- vehicle routing problem