A Branch-and-Bound Algorithm for Concave Network Flow Problems.
Dalila B. M. M. FontesEleni HadjiconstantinouNicos ChristofidesPublished in: J. Glob. Optim. (2006)
Keyphrases
- branch and bound algorithm
- network flow problem
- np hard
- branch and bound
- network design problem
- minimum cost
- lower bound
- objective function
- optimal solution
- network flow
- randomly generated
- minimal cost
- upper bound
- lagrangian relaxation
- np complete
- combinatorial optimization
- approximation algorithms
- single machine scheduling problem
- upper bounding
- worst case
- linear programming
- special case
- mixed integer
- integer programming
- search algorithm
- computational complexity
- scheduling problem
- linear program
- constraint satisfaction problems
- knapsack problem
- bayesian networks
- column generation
- cost function
- network design
- approximate solutions
- multistage