{"id":"https://openalex.org/W7151940981","doi":"https://doi.org/10.48550/arxiv.2604.05152","title":"Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances","display_name":"Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances","publication_year":2026,"publication_date":"2026-04-06","ids":{"openalex":"https://openalex.org/W7151940981","doi":"https://doi.org/10.48550/arxiv.2604.05152"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.05152","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05152","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":null,"license_id":null,"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.05152","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012275487","display_name":"Renan F. F. da Silva","orcid":"https://orcid.org/0000-0003-1142-3343"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"da Silva, Renan Fernando Franco","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017750431","display_name":"Vin\u00edcius Loti de Lima","orcid":"https://orcid.org/0000-0002-4805-4468"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"de Lima, Vin\u00edcius Loti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","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":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133177268","display_name":"Jean-Fran\u00e7ois C\u00f4t\u00e9","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C\u00f4t\u00e9, Jean-Fran\u00e7ois","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088224363","display_name":"Manuel Iori","orcid":"https://orcid.org/0000-0003-2097-6572"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iori, Manuel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9908999800682068,"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.9908999800682068,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0020000000949949026,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.00139999995008111,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.8382999897003174},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6057000160217285},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5745999813079834},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49070000648498535},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.444599986076355},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.430400013923645},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.3840000033378601}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8382999897003174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6984000205993652},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6057000160217285},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5745999813079834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5406000018119812},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49070000648498535},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.444599986076355},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.430400013923645},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.3840000033378601},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3522000014781952},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.3203999996185303},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26980000734329224},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2648000121116638},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.25270000100135803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.05152","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05152","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.05152","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.05152","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.5404593348503113,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Cutting":[1],"Stock":[2,187],"Problem":[3,8],"(CSP)":[4],"and":[5,27,84,113,133,159],"Bin":[6],"Packing":[7],"(BPP)":[9],"are":[10,23,135,179,218],"classical":[11],"combinatorial":[12],"optimization":[13],"problems":[14],"extensively":[15],"studied":[16],"since":[17],"the":[18,36,47,105,123,141,156,163,185,189,193,213,230],"1960s.":[19],"State-of-the-art":[20],"exact":[21,205],"algorithms":[22,154,161],"based":[24],"on":[25],"set-cover":[26],"arc-flow":[28],"models":[29],"whose":[30],"linear":[31],"relaxation,":[32],"rounded":[33],"up,":[34],"matches":[35],"integer":[37],"optimum":[38],"for":[39,138,155,162,226,232],"most":[40],"benchmark":[41],"instances,":[42],"a":[43],"condition":[44],"known":[45],"as":[46,201,207],"Integer":[48],"Round-up":[49],"Property":[50],"(IRUP).":[51],"In":[52,125,195],"2016,":[53],"Delorme":[54],"et":[55],"al.":[56],"showed":[57],"that":[58,130],"all":[59,168],"existing":[60],"instances":[61,115,170,227],"could":[62],"be":[63,199],"solved":[64],"within":[65,118],"ten":[66],"minutes":[67],"by":[68],"approaches":[69],"exploiting":[70],"this":[71,126],"property.":[72],"This":[73],"motivated":[74,101],"them":[75],"to":[76,89,94,144,182,184,220,229],"introduce":[77],"two":[78],"new":[79],"classes,":[80],"Augmented":[81,85],"IRUP":[82,91],"(AI)":[83],"Non-IRUP":[86],"(ANI),":[87],"designed":[88],"make":[90],"less":[92],"evident":[93],"state-of-the-art":[95],"methods.":[96],"Although":[97],"these":[98,145],"classes":[99,146],"have":[100],"significant":[102],"advances":[103],"over":[104],"past":[106],"decade,":[107],"13":[108],"out":[109],"of":[110,172,192,212],"500":[111],"AI":[112,132,157],"ANI":[114,134,164],"remain":[116],"unsolved":[117],"standard":[119],"time":[120],"limits":[121],"from":[122],"literature.":[124],"paper,":[127],"we":[128],"show":[129],"while":[131],"particularly":[136],"hard":[137],"MIP-based":[139],"methods,":[140,206],"BPP":[142],"restricted":[143],"is":[147,210],"not":[148],"strongly":[149],"NP-hard.":[150],"We":[151],"present":[152],"polynomial-time":[153],"class":[158,231],"pseudopolynomial-time":[160],"class,":[165,215],"which":[166,233],"solve":[167],"such":[169],"orders":[171],"magnitude":[173],"faster":[174],"than":[175],"previous":[176],"approaches.":[177],"They":[178],"also":[180],"straightforward":[181],"adapt":[183],"Skiving":[186],"Problem,":[188],"dual":[190],"counterpart":[191],"CSP.":[194],"addition,":[196],"they":[197,217,234],"can":[198],"used":[200],"preprocessing":[202],"routines":[203],"in":[204],"their":[208],"runtime":[209],"independent":[211],"instance":[214],"although":[216],"guaranteed":[219],"return":[221],"an":[222],"optimality":[223],"status":[224],"only":[225],"belonging":[228],"were":[235],"designed.":[236]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-09T00:00:00"}