An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem.
Lianbo GaoShashi Kant MishraJianming ShiPublished in: Optim. Lett. (2012)
Keyphrases
- branch and bound algorithm
- integer variables
- combinatorial optimization
- finding an optimal solution
- lower bound
- branch and bound
- variable ordering
- randomly generated
- np hard
- test problems
- nonlinear equations
- optimal solution
- upper bound
- search tree
- precedence constraints
- lower bounding
- upper bounding
- randomly generated problems
- branch and bound method
- objective function
- lagrangian relaxation
- scheduling problem
- single machine scheduling problem
- mixed integer linear programming
- strongly np hard
- traveling salesman problem
- bayesian networks
- search algorithm
- maximum clique
- optimization problems
- metaheuristic
- column generation
- neural network
- search space