A branch-and-bound algorithm to globally solve the sum of several linear ratios.
Yanjun WangPeiping ShenZhian LiangPublished in: Appl. Math. Comput. (2005)
Keyphrases
- branch and bound algorithm
- mixed integer linear programming
- integer variables
- lower bound
- finding an optimal solution
- branch and bound
- upper bound
- np hard
- precedence constraints
- lower bounding
- combinatorial optimization
- randomly generated problems
- test problems
- search tree
- optimal solution
- variable ordering
- strongly np hard
- objective function
- mathematical programming
- max sat
- lagrangian relaxation
- single machine scheduling problem
- exact methods
- linear functions
- upper bounding
- branch and bound method
- computational complexity
- mixed integer
- integer programming
- search space
- high dimensional
- neural network