An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems.
Bo ZhangYuelin GaoXia LiuXiaolin HuangPublished in: J. Optim. Theory Appl. (2022)
Keyphrases
- branch and bound algorithm
- test problems
- randomly generated problems
- finding an optimal solution
- lower bound
- combinatorial optimization
- branch and bound
- upper bound
- np complete
- np hard
- set covering problem
- mixed integer linear programming
- branch and bound method
- search methods
- lower bounding
- objective function
- linear programming
- optimization problems
- single machine scheduling problem
- benchmark problems
- high dimensional
- optimal solution