{"id":"https://openalex.org/W2043033472","doi":"https://doi.org/10.1137/120880355","title":"On the Robust Knapsack Problem","display_name":"On the Robust Knapsack Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2043033472","doi":"https://doi.org/10.1137/120880355","mag":"2043033472"},"language":"en","primary_location":{"id":"doi:10.1137/120880355","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120880355","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/A5055569763","display_name":"Michele Monaci","orcid":"https://orcid.org/0000-0001-9978-7613"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michele Monaci","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":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.1765,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.97096252,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"4","first_page":"1956","last_page":"1982"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"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.9994000196456909,"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.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9441553354263306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8738570213317871},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7649060487747192},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.666527509689331},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.6262585520744324},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6090559959411621},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5692440271377563},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5626093149185181},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5526290535926819},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.49298831820487976},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4641035795211792},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.45141106843948364},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41731321811676025},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3166523575782776},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10493513941764832},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10080340504646301}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9441553354263306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8738570213317871},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7649060487747192},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.666527509689331},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.6262585520744324},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6090559959411621},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5692440271377563},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5626093149185181},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5526290535926819},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.49298831820487976},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4641035795211792},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.45141106843948364},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41731321811676025},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3166523575782776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10493513941764832},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10080340504646301},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/120880355","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120880355","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:cris.unibo.it:11585/542427","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/542427","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:www.research.unipd.it:11577/2825699","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/2825699","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W81762446","https://openalex.org/W91408871","https://openalex.org/W1512733480","https://openalex.org/W1970608397","https://openalex.org/W1980035156","https://openalex.org/W1990275757","https://openalex.org/W2003777645","https://openalex.org/W2012963530","https://openalex.org/W2027111774","https://openalex.org/W2036826174","https://openalex.org/W2037342851","https://openalex.org/W2060298874","https://openalex.org/W2060322444","https://openalex.org/W2071335627","https://openalex.org/W2076163541","https://openalex.org/W2089105401","https://openalex.org/W2118578357","https://openalex.org/W2131116400","https://openalex.org/W2152324313","https://openalex.org/W2156698143","https://openalex.org/W2163551942","https://openalex.org/W2165775468","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2005493932","https://openalex.org/W4249611560","https://openalex.org/W2993365626","https://openalex.org/W2087209118","https://openalex.org/W2020081923","https://openalex.org/W2412614002","https://openalex.org/W1483913682","https://openalex.org/W1969981152","https://openalex.org/W2168163332"],"abstract_inverted_index":{"We":[0,47,75],"consider":[1,130],"an":[2,146],"uncertain":[3],"variant":[4,122],"of":[5,15,33,51,84,96,123],"the":[6,12,31,39,49,52,59,77,81,85,97,103,110,116,124,142],"knapsack":[7],"problem":[8,86,118,144],"that":[9],"arises":[10],"when":[11],"exact":[13],"weight":[14,36],"each":[16],"item":[17],"is":[18,42,90],"not":[19],"exactly":[20,63],"known":[21],"in":[22,87,145],"advance":[23],"but":[24],"belongs":[25],"to":[26,58,92,109],"a":[27,45,121,131,137],"given":[28],"interval,":[29],"and":[30,62,119,135],"number":[32],"items":[34],"whose":[35],"differs":[37],"from":[38],"nominal":[40],"value":[41,55],"bounded":[43],"by":[44],"constant.":[46],"analyze":[48],"worsening":[50],"optimal":[53,111],"solution":[54,112],"with":[56,107],"respect":[57,108],"classical":[60],"problem,":[61],"determine":[64],"its":[65],"worst-case":[66,104],"performance":[67,105],"depending":[68],"on":[69],"uncertainty":[70],"for":[71,80,114,120,140],"all":[72],"parameter":[73],"configurations.":[74],"perform":[76],"same":[78],"analysis":[79],"fractional":[82,117,143],"version":[83],"which":[88],"one":[89],"allowed":[91],"pack":[93],"any":[94],"fraction":[95],"items.":[98],"In":[99],"addition,":[100],"we":[101,129],"derive":[102],"ratio":[106],"value,":[113],"both":[115],"well-known":[125],"greedy":[126],"algorithm.":[127],"Finally,":[128],"relevant":[132],"special":[133],"case":[134],"provide":[136],"combinatorial":[138],"algorithm":[139],"solving":[141],"efficient":[147],"way.":[148]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}