Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Complexity of solving the Subset Sum problem with the branch-and-bound ..."

Roman M. Kolpakov, Mikhail Posypkin, Si Tu Tant Sin (2017)

> Home

Details and statistics

DOI: 10.1134/S0005117917030079

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/aarc/KolpakovPS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aarc/KolpakovPS17
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)

a service of

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.