A Branch and Bound Algorithm for Minimum Cost Network Flow Problem.
Jun HanGraham McMahonStephen SugdenPublished in: IDEAL (2002)
Keyphrases
- branch and bound algorithm
- minimum cost
- network flow problem
- np hard
- lower bound
- network simplex algorithm
- approximation algorithms
- network flow
- randomly generated
- optimal solution
- lagrangian relaxation
- scheduling problem
- np complete
- branch and bound
- worst case
- special case
- constraint satisfaction problems
- combinatorial optimization
- upper bound
- linear programming
- integer programming
- minimum cost flow
- knapsack problem
- computational complexity
- linear program
- minimal cost
- multistage
- optimization problems
- search algorithm