Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering
Crossref DOI link: https://doi.org/10.1134/S0005117917030079
Published Online: 2017-03-11
Published Print: 2017-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kolpakov, R. M.
Posypkin, M. A.
Sin, Si Tu Tant
License valid from 2017-03-01