An improved branch and bound algorithm for minimum concave cost network flow problems.
Bruce W. LamarPublished in: J. Glob. Optim. (1993)
Keyphrases
- branch and bound algorithm
- minimum cost
- network flow problem
- np hard
- fixed charge
- lower bound
- randomly generated
- optimal solution
- minimal cost
- approximation algorithms
- branch and bound
- lagrangian relaxation
- network flow
- upper bound
- lower bounding
- network design problem
- upper bounding
- linear programming
- single machine scheduling problem
- special case
- combinatorial optimization
- objective function
- transportation problem
- constraint satisfaction problems
- search space
- mixed integer
- knapsack problem
- computational complexity
- worst case
- integer programming
- scheduling problem
- linear program
- constraint satisfaction