{"id":"https://openalex.org/W7152054339","doi":"https://doi.org/10.48550/arxiv.2604.05232","title":"Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver","display_name":"Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver","publication_year":2026,"publication_date":"2026-04-06","ids":{"openalex":"https://openalex.org/W7152054339","doi":"https://doi.org/10.48550/arxiv.2604.05232"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.05232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05232","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.05232","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133204561","display_name":"Renan F. F. da Silva","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"da Silva, Renan F. F.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133203286","display_name":"Thiago A. de Queiroz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"de Queiroz, Thiago A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133213691","display_name":"Rafael C. S. Schouery","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schouery, Rafael C. S.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.262800008058548,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.262800008058548,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.21199999749660492,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.10760000348091125,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.921500027179718},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6815000176429749},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6811000108718872},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5184999704360962},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5134000182151794},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4864000082015991},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.400299996137619},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.3995000123977661}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.921500027179718},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6815000176429749},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6811000108718872},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5184999704360962},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5170000195503235},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5134000182151794},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4864000082015991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4383000135421753},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4058000147342682},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.400299996137619},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.3995000123977661},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.3741999864578247},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.33250001072883606},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3158999979496002},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3122999966144562},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.30559998750686646},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.29910001158714294},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2818000018596649},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.05232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05232","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.05232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05232","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Knapsack":[1,9],"Problem":[2,10],"(KP)":[3],"and":[4,20,31,45,74,81,117,126,149,159,178],"its":[5,93],"generalization,":[6],"the":[7,28,34,37,103],"Bounded":[8],"(BKP),":[11],"are":[12],"classical":[13],"NP-hard":[14],"problems":[15,64],"with":[16,84,110],"numerous":[17],"practical":[18],"applications,":[19],"despite":[21],"being":[22],"introduced":[23],"over":[24],"25":[25],"years":[26],"ago,":[27],"solvers":[29],"COMBO":[30,158],"BOUKNAP":[32,160],"remain":[33],"state":[35],"of":[36,70,105,169],"art":[38],"due":[39],"to":[40,91,101,133],"their":[41],"highly":[42],"optimized":[43],"implementations":[44],"sophisticated":[46],"bounding":[47],"techniques.":[48],"In":[49,95],"this":[50],"work,":[51],"we":[52,97],"present":[53],"RECORD":[54,132],"(Refined":[55],"Core-based":[56],"Dynamic":[57],"Programming),":[58],"a":[59,118,172],"new":[60,119,173],"solver":[61,175],"for":[62,176],"both":[63,157],"that":[65,122,153],"builds":[66],"upon":[67],"key":[68],"components":[69],"COMBO,":[71],"including":[72],"core-":[73],"state-based":[75],"dynamic":[76],"programming,":[77],"weak":[78],"upper":[79],"bounds,":[80],"surrogate":[82],"relaxation":[83],"cardinality":[85],"constraints,":[86],"while":[87,141],"introducing":[88],"novel":[89],"strategies":[90],"overcome":[92],"limitations.":[94],"particular,":[96],"propose":[98],"multiplicity":[99],"reduction":[100],"limit":[102],"number":[104],"distinct":[106],"item":[107,112,124],"types,":[108],"combined":[109],"on-the-fly":[111],"aggregation,":[113],"refined":[114],"fixing-by-dominance":[115],"techniques,":[116],"divisibility":[120],"bound":[121],"strengthens":[123],"fixing":[125],"symmetry":[127],"breaking.":[128],"These":[129],"enhancements":[130],"allow":[131],"preserve":[134],"COMBO's":[135],"near-linear-time":[136],"behavior":[137],"on":[138,145,161],"most":[139],"instances":[140],"achieving":[142],"substantial":[143],"speedups":[144],"more":[146],"challenging":[147],"cases,":[148],"computational":[150],"experiments":[151],"show":[152],"it":[154],"consistently":[155],"outperforms":[156],"difficult":[162],"benchmark":[163],"sets,":[164],"often":[165],"by":[166],"several":[167],"orders":[168],"magnitude,":[170],"establishing":[171],"state-of-the-art":[174],"KP":[177],"BKP.":[179]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-09T00:00:00"}