A finite concave minimization algorithm using branch and bound and neighbor generation.
Harold P. BensonSerpil SayinPublished in: J. Glob. Optim. (1994)
Keyphrases
- branch and bound
- objective function
- optimal solution
- search space
- search algorithm
- dynamic programming
- computational complexity
- cost function
- combinatorial optimization
- branch and bound procedure
- network design problem
- mathematical model
- np hard
- lower bound
- branch and bound algorithm
- branch and bound method
- tree search algorithm
- space complexity
- column generation
- minimal cost
- branch and bound search