Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving ..."

Roman Kolpakov, Mikhail Posypkin (2021)

> Home

Details and statistics

DOI: 10.1515/COMP-2020-0212

access: open

type: Journal Article

metadata version: 2022-12-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/cejcs/KolpakovP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cejcs/KolpakovP21
Roman Kolpakov, Mikhail Posypkin:
Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem. Open Comput. Sci. 11(1): 116-126 (2021)

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.