Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering - researchr publication

researchr

You are not signed in
Sign in
Sign up

Roman M. Kolpakov, Mikhail Posypkin, Si Tu Tant Sin. Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering. Automation and Remote Control, 78(3):463-474, 2017. [doi]

Abstract is missing.

runs on WebDSL