Stop the war!
Остановите войну!
for scientists:
default search action
"Complexity of solving the Subset Sum problem with the branch-and-bound ..."
Roman M. Kolpakov, Mikhail Posypkin, Si Tu Tant Sin (2017)
- 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. Autom. Remote. Control. 78(3): 463-474 (2017)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.