Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem.
Roman KolpakovMikhail PosypkinPublished in: Open Comput. Sci. (2021)
Keyphrases
- complexity analysis
- branch and bound method
- lower bound
- exact methods
- branch and bound algorithm
- branch and bound
- discrete optimization problems
- lower and upper bounds
- upper bound
- integer linear programming formulation
- optimal solution
- theoretical analysis
- reduce the search space
- feasible solution
- timetabling problem
- computational complexity
- optimal configuration
- first order logic
- stochastic local search
- search algorithm
- combinatorial optimization
- mixed integer programming
- objective function
- linear programming
- discrete optimization
- genetic algorithm