Login / Signup
Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering.
Roman M. Kolpakov
Mikhail Posypkin
Si Tu Tant Sin
Published in:
Autom. Remote. Control. (2017)
Keyphrases
</>
branch and bound method
discrete optimization problems
branch and bound
decision problems
combinatorial optimization
branch and bound algorithm
reduce the search space
optimal configuration
computational complexity
lower bound
worst case
mixed integer programming
generative model
utility function