{"id":"https://openalex.org/W3115492842","doi":"https://doi.org/10.1515/comp-2020-0212","title":"Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem","display_name":"Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem","publication_year":2020,"publication_date":"2020-12-17","ids":{"openalex":"https://openalex.org/W3115492842","doi":"https://doi.org/10.1515/comp-2020-0212","mag":"3115492842"},"language":"en","primary_location":{"id":"doi:10.1515/comp-2020-0212","is_oa":true,"landing_page_url":"https://doi.org/10.1515/comp-2020-0212","pdf_url":"https://www.degruyter.com/document/doi/10.1515/comp-2020-0212/pdf","source":{"id":"https://openalex.org/S4210177004","display_name":"Open Computer Science","issn_l":"2299-1093","issn":["2299-1093"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.degruyter.com/document/doi/10.1515/comp-2020-0212/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000458313","display_name":"Roman Kolpakov","orcid":"https://orcid.org/0000-0003-1800-853X"},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Roman Kolpakov","raw_affiliation_strings":["Lomonosov Moscow State University , Leninskie Gory , Moscow , Russia and Federal Research Center \u201cComputer Science and Control\u201d of RAS , Vavilov st. 40 , Moscow , Russia"],"affiliations":[{"raw_affiliation_string":"Lomonosov Moscow State University , Leninskie Gory , Moscow , Russia and Federal Research Center \u201cComputer Science and Control\u201d of RAS , Vavilov st. 40 , Moscow , Russia","institution_ids":["https://openalex.org/I19880235"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090825054","display_name":"Mikhail Posypkin","orcid":"https://orcid.org/0000-0002-4143-4353"},"institutions":[{"id":"https://openalex.org/I153845743","display_name":"Moscow Institute of Physics and Technology","ror":"https://ror.org/00v0z9322","country_code":"RU","type":"education","lineage":["https://openalex.org/I153845743"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Mikhail Posypkin","raw_affiliation_strings":["Moscow Institute of Physics and Technology , Moscow , Russia and Federal Research Center \u201cComputer Science and Control\u201d of RAS , Vavilov st. 40 , Moscow , Russia"],"affiliations":[{"raw_affiliation_string":"Moscow Institute of Physics and Technology , Moscow , Russia and Federal Research Center \u201cComputer Science and Control\u201d of RAS , Vavilov st. 40 , Moscow , Russia","institution_ids":["https://openalex.org/I153845743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000458313"],"corresponding_institution_ids":["https://openalex.org/I19880235"],"apc_list":{"value":1000,"currency":"EUR","value_usd":1078},"apc_paid":{"value":1000,"currency":"EUR","value_usd":1078},"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.2402616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"11","issue":"1","first_page":"116","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8707454204559326},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6171325445175171},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.571148157119751},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5464559197425842},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5043374300003052},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48095789551734924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.463360071182251},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3221760392189026}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8707454204559326},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6171325445175171},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.571148157119751},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5464559197425842},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5043374300003052},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48095789551734924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.463360071182251},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3221760392189026},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1515/comp-2020-0212","is_oa":true,"landing_page_url":"https://doi.org/10.1515/comp-2020-0212","pdf_url":"https://www.degruyter.com/document/doi/10.1515/comp-2020-0212/pdf","source":{"id":"https://openalex.org/S4210177004","display_name":"Open Computer Science","issn_l":"2299-1093","issn":["2299-1093"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:b97b623a0e034f41bd543ef396b8efcf","is_oa":true,"landing_page_url":"https://doaj.org/article/b97b623a0e034f41bd543ef396b8efcf","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Open Computer Science, Vol 11, Iss 1, Pp 116-126 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1515/comp-2020-0212","is_oa":true,"landing_page_url":"https://doi.org/10.1515/comp-2020-0212","pdf_url":"https://www.degruyter.com/document/doi/10.1515/comp-2020-0212/pdf","source":{"id":"https://openalex.org/S4210177004","display_name":"Open Computer Science","issn_l":"2299-1093","issn":["2299-1093"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3115492842.pdf","grobid_xml":"https://content.openalex.org/works/W3115492842.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1737501191","https://openalex.org/W1939990554","https://openalex.org/W1945588072","https://openalex.org/W1978530168","https://openalex.org/W1981292851","https://openalex.org/W1984941464","https://openalex.org/W1991463669","https://openalex.org/W2003727283","https://openalex.org/W2017669128","https://openalex.org/W2045492613","https://openalex.org/W2047372095","https://openalex.org/W2068647723","https://openalex.org/W2086077660","https://openalex.org/W2096100178","https://openalex.org/W2097532275","https://openalex.org/W2099953837","https://openalex.org/W2105530275","https://openalex.org/W2121034604","https://openalex.org/W2134343603","https://openalex.org/W2154117831","https://openalex.org/W2265572943","https://openalex.org/W2338188794","https://openalex.org/W2341171179","https://openalex.org/W2505340164","https://openalex.org/W2537648740","https://openalex.org/W2588454908","https://openalex.org/W2751425733","https://openalex.org/W2901464676","https://openalex.org/W4236127247"],"related_works":["https://openalex.org/W1520614092","https://openalex.org/W2922506098","https://openalex.org/W2389156036","https://openalex.org/W2922514085","https://openalex.org/W1990489976","https://openalex.org/W4377227120","https://openalex.org/W2060547385","https://openalex.org/W1546205275","https://openalex.org/W1572789216","https://openalex.org/W2049594334"],"abstract_inverted_index":{"Abstract":[0],"In":[1,75],"this":[2,41,120],"paper":[3],"we":[4,122],"study":[5,143],"the":[6,19,29,38,46,51,73,76,79,96,104,109,113,134,139,144,148,151,159],"question":[7,42],"of":[8,10,13,18,28,40,50,58,61,70,72,112,127,136,138,147,150,158],"parallelization":[9,131],"a":[11,25,63,125],"variant":[12],"Branch-and-Bound":[14],"method":[15],"for":[16,87,154],"solving":[17,62,88],"subset":[20,160],"sum":[21,161],"problem":[22,65,115],"which":[23,107],"is":[24,43],"special":[26,156],"case":[27],"Boolean":[30],"knapsack":[31],"problem.":[32,74,162],"The":[33],"following":[34],"natural":[35],"approach":[36,121],"to":[37,84,103],"solution":[39,111],"considered.":[44],"At":[45],"first":[47],"stage":[48,78],"one":[49],"processors":[52,86],"(control":[53],"processor)":[54],"performs":[55],"some":[56,68],"number":[57,69],"algorithm":[59],"steps":[60],"given":[64],"with":[66],"generating":[67],"subproblems":[71,81,98],"second":[77],"generated":[80],"are":[82],"sent":[83],"other":[85],"(one":[89],"subproblem":[90],"per":[91],"processor).":[92],"Processors":[93],"solve":[94],"completely":[95],"received":[97],"and":[99,133],"return":[100],"their":[101],"solutions":[102],"control":[105],"processor":[106],"chooses":[108],"optimal":[110],"initial":[114],"from":[116],"these":[117],"solutions.":[118],"For":[119],"define":[123],"formally":[124],"model":[126],"parallel":[128],"computing":[129],"(frontal":[130],"scheme)":[132],"notion":[135],"complexity":[137,149],"frontal":[140,152],"scheme.":[141],"We":[142],"asymptotic":[145],"behavior":[146],"scheme":[153],"two":[155],"cases":[157]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}