A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem.
Harold P. BensonPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- branch and bound
- search space
- optimal solution
- lower bound
- objective function
- cost function
- tree search algorithm
- branch and bound search
- worst case
- upper bound
- monte carlo
- computational complexity
- branch and bound method
- search algorithm
- dynamic programming
- linear programming
- column generation
- np hard
- convergence rate
- branch and bound algorithm
- probabilistic model
- combinatorial optimization
- space complexity
- partial solutions
- integer programming problems