A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables.
Pitchaya WiratchotisatianAndrew C. TrappPublished in: Optim. Lett. (2023)
Keyphrases
- optimization problems
- integer variables
- objective function
- knapsack problem
- evolutionary algorithm
- cost function
- branch and bound algorithm
- metaheuristic
- combinatorial optimization
- lower bound
- multi objective
- continuous variables
- optimal solution
- traveling salesman problem
- linear program
- multistage
- global optimum
- greedy algorithm
- linear programming
- mixed integer
- feasible solution
- search algorithm