{"id":"https://openalex.org/W4384388076","doi":"https://doi.org/10.1007/s10878-026-01425-4","title":"Approximation algorithms for the Square Min-Sum Bin Packing Problem","display_name":"Approximation algorithms for the Square Min-Sum Bin Packing Problem","publication_year":2026,"publication_date":"2026-05-18","ids":{"openalex":"https://openalex.org/W4384388076","doi":"https://doi.org/10.1007/s10878-026-01425-4"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-026-01425-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-026-01425-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-026-01425-4.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-026-01425-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086556650","display_name":"Rachel Vanucchi Saraiva","orcid":null},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Rachel Vanucchi Saraiva","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (UNICAMP), Campinas, Brazil","Institute of Computing, University of Campinas, Brazil"],"raw_orcid":"https://orcid.org/0000-0001-6197-603X","affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (UNICAMP), Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]},{"raw_affiliation_string":"Institute of Computing, University of Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036752449","display_name":"Rafael C. S. Schouery","orcid":"https://orcid.org/0000-0002-0472-4810"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Rafael C. S. Schouery","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (UNICAMP), Campinas, Brazil","Institute of Computing, University of Campinas, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-0472-4810","affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (UNICAMP), Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]},{"raw_affiliation_string":"Institute of Computing, University of Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086556650"],"corresponding_institution_ids":["https://openalex.org/I181391015"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00032077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"5","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.9997000098228455,"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.9997000098228455,"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.9977999925613403,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9613999724388123,"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.9537018537521362},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.8258488178253174},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.780614972114563},{"id":"https://openalex.org/keywords/square","display_name":"Square (algebra)","score":0.7535691857337952},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6399149298667908},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5442143082618713},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.485416978597641},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47943371534347534},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4572427570819855},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.4183003008365631},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3905623257160187},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3331020474433899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2824682593345642},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09700077772140503}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9537018537521362},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.8258488178253174},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.780614972114563},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.7535691857337952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6399149298667908},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5442143082618713},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.485416978597641},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47943371534347534},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4572427570819855},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.4183003008365631},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3905623257160187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3331020474433899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2824682593345642},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09700077772140503},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-026-01425-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-026-01425-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-026-01425-4.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2307.06776","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2307.06776","pdf_url":"https://arxiv.org/pdf/2307.06776","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2307.06776","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2307.06776","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.1007/s10878-026-01425-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-026-01425-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-026-01425-4.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G2436822708","display_name":null,"funder_award_id":"88887.602019/2021-00","funder_id":"https://openalex.org/F4320321091","funder_display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior"},{"id":"https://openalex.org/G4459363514","display_name":null,"funder_award_id":"404779/2025-5","funder_id":"https://openalex.org/F4320321091","funder_display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior"},{"id":"https://openalex.org/G5259322532","display_name":null,"funder_award_id":"163644/2021-7","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G6132555478","display_name":null,"funder_award_id":"2022/05803-3","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"},{"id":"https://openalex.org/G8424903403","display_name":null,"funder_award_id":"2372/23","funder_id":"https://openalex.org/F4320335141","funder_display_name":"Fundo de Apoio ao Ensino, \u00e0 Pesquisa e Extens\u00e3o, Universidade Estadual de Campinas"},{"id":"https://openalex.org/G93704290","display_name":null,"funder_award_id":"312345/2023-2","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"},{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320335141","display_name":"Fundo de Apoio ao Ensino, \u00e0 Pesquisa e Extens\u00e3o, Universidade Estadual de Campinas","ror":"https://ror.org/04wffgt70"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4384388076.pdf","grobid_xml":"https://content.openalex.org/works/W4384388076.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W173368591","https://openalex.org/W2034272113","https://openalex.org/W2138242427","https://openalex.org/W4255148175","https://openalex.org/W2104955674","https://openalex.org/W4288260564","https://openalex.org/W2068892231","https://openalex.org/W2096053066"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"work,":[3],"we":[4,226],"study":[5],"the":[6,44,47,57,66,69,81,93,104,232],"Square":[7],"Min-Sum":[8],"Bin":[9],"Packing":[10],"Problem":[11],"(SMSBPP),":[12],"where":[13],"a":[14,229],"list":[15],"of":[16,27,46,59,68,84,96,107,116,133,164],"n":[17],"square":[18,25],"items":[19,129],"has":[20,100],"to":[21,65,79,91],"be":[22],"packed":[23],"into":[24],"bins":[26,50],"dimensions":[28],"$$1":[29],"\\times":[30],"1$$":[31],"<mml:math":[32,167,183,198,213],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[33,168,184,199,214],"<mml:mrow>":[34,169,185,200,215],"<mml:mn>1</mml:mn>":[35,37],"<mml:mo>\u00d7</mml:mo>":[36],"</mml:mrow>":[38,177,190,204,222],"</mml:math>":[39,178,191,205,223],"with":[40,160],"no":[41],"overlap":[42],"between":[43],"areas":[45],"items.":[48,97],"The":[49,76,98],"are":[51],"indexed":[52],"(starting":[53],"at":[54],"one)":[55],"and":[56,114,207],"cost":[58,83,95],"packing":[60,85,126],"each":[61],"item":[62],"is":[63,74,78,89],"equal":[64],"index":[67],"bin":[70,125],"in":[71,102,130],"which":[72,88],"it":[73],"placed.":[75],"objective":[77],"minimize":[80],"total":[82],"all":[86],"items,":[87],"equivalent":[90],"minimizing":[92,103],"average":[94,105],"problem":[99],"applications":[101],"time":[106,209],"logistic":[108],"operations":[109],"such":[110,135],"as":[111,136],"cutting":[112],"stock":[113],"delivery":[115],"products.":[117],"We":[118],"prove":[119],"that":[120,127],"classic":[121],"algorithms":[122],"for":[123,153,193,231],"two-dimensional":[124],"order":[128,132],"non-increasing":[131],"size,":[134],"Next":[137],"Fit":[138,143],"Decreasing":[139,144],"Height":[140,145],"or":[141],"Any":[142],"heuristics,":[146],"can":[147],"have":[148],"an":[149,158,161],"arbitrarily":[150],"bad":[151],"performance":[152],"SMSBPP.":[154],"We,":[155],"then,":[156],"present":[157,228],"algorithm":[159],"approximation":[162],"ratio":[163],"$$\\sqrt{205}-12+\\delta":[165],"$$":[166,182],"<mml:msqrt>":[170],"<mml:mn>205</mml:mn>":[171],"</mml:msqrt>":[172],"<mml:mo>-</mml:mo>":[173],"<mml:mn>12</mml:mn>":[174],"<mml:mo>+</mml:mo>":[175,188],"<mml:mi>\u03b4</mml:mi>":[176,189,201],"(":[179],"$$\\approx":[180],"2.3178+\\delta":[181],"<mml:mo>\u2248</mml:mo>":[186],"<mml:mn>2.3178</mml:mn>":[187],"),":[192],"any":[194],"$$\\delta":[195],"&gt;":[196],"0$$":[197],"<mml:mo>&gt;</mml:mo>":[202],"<mml:mn>0</mml:mn>":[203],",":[206],"running":[208],"$$O(n":[210],"\\log":[211],"n)$$":[212],"<mml:mi>O</mml:mi>":[216],"<mml:mo>(</mml:mo>":[217],"<mml:mi>n</mml:mi>":[218,220],"<mml:mo>log</mml:mo>":[219],"<mml:mo>)</mml:mo>":[221],".":[224],"Finally,":[225],"also":[227],"PTAS":[230],"problem.":[233]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}