A practicable branch and bound algorithm for sum of linear ratios problem.
Hong-Wei JiaoSan-Yang LiuPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- test problems
- search tree
- integer variables
- randomly generated problems
- combinatorial optimization
- lower bounding
- single machine scheduling problem
- np hard
- objective function
- linear functions
- upper bounding
- mixed integer linear programming
- finding an optimal solution
- maximum clique
- lagrangian relaxation
- precedence constraints
- variable ordering
- special case
- branch and bound method
- lower and upper bounds
- linear programming
- search algorithm