{"id":"https://openalex.org/W1975503278","doi":"https://doi.org/10.1137/s1052623498348481","title":"The Multiple Subset Sum Problem","display_name":"The Multiple Subset Sum Problem","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1975503278","doi":"https://doi.org/10.1137/s1052623498348481","mag":"1975503278"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623498348481","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623498348481","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011745294","display_name":"Alberto Caprara","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alberto Caprara","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079478965","display_name":"Hans Kellerer","orcid":"https://orcid.org/0000-0001-7618-3956"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hans Kellerer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5069744603","display_name":"Ulrich Pferschy","orcid":"https://orcid.org/0000-0001-8881-1497"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ulrich Pferschy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011745294"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.4839,"has_fulltext":false,"cited_by_count":107,"citation_normalized_percentile":{"value":0.96954072,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"11","issue":"2","first_page":"308","last_page":"319"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":1.0,"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":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9973999857902527,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9347872734069824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8501511216163635},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7288742065429688},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.622717022895813},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5939423441886902},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5835338830947876},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5735008716583252},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.5059911608695984},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4963856339454651},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.48960787057876587},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4634857475757599},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.43305331468582153},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41063186526298523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39559584856033325},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38698965311050415},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18139702081680298},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10663720965385437}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9347872734069824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8501511216163635},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7288742065429688},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.622717022895813},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5939423441886902},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5835338830947876},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5735008716583252},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.5059911608695984},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4963856339454651},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.48960787057876587},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4634857475757599},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.43305331468582153},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41063186526298523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39559584856033325},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38698965311050415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18139702081680298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10663720965385437},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623498348481","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623498348481","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.21.9826","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.or.deis.unibo.it/alberto/mssp_siam.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1990489976","https://openalex.org/W2011039300","https://openalex.org/W2048624116","https://openalex.org/W2066671865","https://openalex.org/W2088961276","https://openalex.org/W2114616381","https://openalex.org/W2123068254","https://openalex.org/W2145028977"],"related_works":["https://openalex.org/W3169691842","https://openalex.org/W1990489976","https://openalex.org/W2900218461","https://openalex.org/W2087209118","https://openalex.org/W2352476958","https://openalex.org/W2005493932","https://openalex.org/W2102846492","https://openalex.org/W2041673501","https://openalex.org/W2993365626","https://openalex.org/W2076844787"],"abstract_inverted_index":{"In":[0],"the":[1,27,30,39,43,47,50,66,72,86,95,99,107,111,114,136,146,152,157,171,185],"{\\em":[2],"multiple":[3,67],"subset":[4],"sum":[5,28,45],"problem}":[6],"(MSSP)":[7],"items":[8,51],"from":[9],"a":[10,19,61,75,102,128],"given":[11,20],"ground":[12],"set":[13],"are":[14,143],"selected":[15],"and":[16,42,131],"packed":[17,52],"into":[18],"number":[21,153,158],"of":[22,29,46,49,65,74,88,94,101,110,154,159,173,184],"identical":[23],"bins":[24,155],"such":[25],"that":[26,133],"item":[31,161],"weights":[32,48,162],"in":[33,85,119,149],"every":[34],"bin":[35,40,121],"does":[36],"not":[37],"exceed":[38],"capacity":[41],"total":[44,116],"is":[53,60,80,98,122,135,163],"as":[54,56],"large":[55],"possible.":[57],"This":[58],"problem":[59],"relevant":[62],"special":[63,147],"case":[64,109,172],"knapsack":[68,89],"problem,":[69,112],"for":[70,104,145,170,181],"which":[71,150],"existence":[73],"polynomial-time":[76],"approximation":[77,139],"scheme":[78],"(PTAS)":[79],"an":[81],"important":[82],"open":[83],"question":[84],"field":[87],"problems.":[90],"One":[91],"main":[92],"result":[93],"present":[96],"paper":[97],"construction":[100],"PTAS":[103,179],"MSSP.":[105],"For":[106],"bottleneck":[108],"where":[113],"minimum":[115],"weight":[117],"contained":[118],"any":[120],"to":[123],"be":[124],"maximized,":[125],"we":[126],"describe":[127],"2/3-approximation":[129],"algorithm":[130],"show":[132,167],"this":[134],"best":[137],"possible":[138],"ratio.":[140],"Moreover,":[141],"PTASs":[142],"derived":[144],"cases":[148],"either":[151],"or":[156],"different":[160],"constant.":[164],"We":[165],"finally":[166],"that,":[168],"even":[169],"only":[174],"two":[175],"bins,":[176],"no":[177],"fully":[178],"exists":[180],"both":[182],"versions":[183],"problem.":[186]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}