A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem.
Peiping ShenYafei WangDianxiao WuPublished in: Numer. Algorithms (2023)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- integer variables
- branch and bound
- lower bound
- variable ordering
- finding an optimal solution
- quadratic programming
- randomly generated
- lower bounding
- test problems
- optimal solution
- np hard
- optimization problems
- upper bound
- precedence constraints
- metaheuristic
- simulated annealing
- quadratic program
- objective function
- mathematical programming
- upper bounding
- traveling salesman problem
- randomly generated problems
- lagrangian relaxation
- single machine scheduling problem
- optimization algorithm
- mixed integer linear programming
- linear programming
- weighted max sat
- search space
- semidefinite
- exact methods
- branch and bound method
- neural network