{"id":"https://openalex.org/W2072676072","doi":"https://doi.org/10.1137/s0097539799180408","title":"Algorithms for the Relaxed Online Bin-Packing Model","display_name":"Algorithms for the Relaxed Online Bin-Packing Model","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2072676072","doi":"https://doi.org/10.1137/s0097539799180408","mag":"2072676072"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799180408","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799180408","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5091418042","display_name":"Giorgio Gambosi","orcid":"https://orcid.org/0000-0001-9979-6931"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Giorgio Gambosi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029125030","display_name":"A. Postiglione","orcid":"https://orcid.org/0000-0001-6411-6529"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alberto Postiglione","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077567390","display_name":"Maurizio Talamo","orcid":"https://orcid.org/0000-0002-3888-0889"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maurizio Talamo","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":0.0,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.21110457,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"5","first_page":"1532","last_page":"1551"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9987000226974487,"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","display_name":"Bin","score":0.8106892108917236},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.715311586856842},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.6924986243247986},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.6839932203292847},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5619539618492126},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5469470620155334},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5065840482711792},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4952334463596344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4931327998638153},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46886900067329407},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46572086215019226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4416027069091797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43508657813072205},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4324818551540375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3422084450721741},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07741120457649231}],"concepts":[{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.8106892108917236},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.715311586856842},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.6924986243247986},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.6839932203292847},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5619539618492126},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5469470620155334},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5065840482711792},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4952334463596344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4931327998638153},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46886900067329407},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46572086215019226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4416027069091797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43508657813072205},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4324818551540375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3422084450721741},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07741120457649231},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539799180408","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799180408","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:art.torvergata.it:2108/41897","is_oa":false,"landing_page_url":"http://hdl.handle.net/2108/41897","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"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":29,"referenced_works":["https://openalex.org/W136336212","https://openalex.org/W1513400187","https://openalex.org/W1519941054","https://openalex.org/W1655990431","https://openalex.org/W1971235162","https://openalex.org/W1974711138","https://openalex.org/W1977838253","https://openalex.org/W1993191967","https://openalex.org/W2005908084","https://openalex.org/W2009931551","https://openalex.org/W2011039300","https://openalex.org/W2016393589","https://openalex.org/W2025787252","https://openalex.org/W2026364494","https://openalex.org/W2043862089","https://openalex.org/W2048628062","https://openalex.org/W2048905935","https://openalex.org/W2055872862","https://openalex.org/W2067058623","https://openalex.org/W2078659331","https://openalex.org/W2082099352","https://openalex.org/W2085478109","https://openalex.org/W2089095098","https://openalex.org/W2089269509","https://openalex.org/W2104680817","https://openalex.org/W2123068254","https://openalex.org/W2137909125","https://openalex.org/W2144946856","https://openalex.org/W2418222029"],"related_works":["https://openalex.org/W4298194926","https://openalex.org/W2963196750","https://openalex.org/W1519618847","https://openalex.org/W2738247252","https://openalex.org/W2625125039","https://openalex.org/W2997451510","https://openalex.org/W4289753381","https://openalex.org/W2531389723","https://openalex.org/W1967408277","https://openalex.org/W2072676072"],"abstract_inverted_index":{"The":[0,123],"typical":[1,46],"online":[2,47,77,118,235,254],"bin-packing":[3,78,236,255],"problem":[4],"requires":[5],"the":[6,26,34,37,75,102,111,144,174,181,188,198,209,218,225,234,239,259,265,275],"fitting":[7],"of":[8,11,19,21,33,39,73,89,101,104,113,171,180,183,211,241,267,272],"a":[9,16,86,99,105,132,158,168,178,184,268],"sequence":[10],"rationals":[12],"in":[13,110,217],"(0,1]":[14],"into":[15],"minimum":[17],"number":[18,38,88,170,210],"bins":[20,273],"unit":[22],"capacity,":[23],"by":[24],"packing":[25],"ith":[27],"input":[28,40,107,186],"element":[29,60,167],"without":[30,238],"any":[31,55,250],"knowledge":[32],"sizes":[35],"or":[36],"elements":[41,90],"that":[42,208],"follow.":[43],"Moreover,":[44,243],"unlike":[45,258],"problems,":[48],"this":[49,70,83,114],"one":[50,65,94],"issue":[51],"does":[52],"not":[53],"admit":[54],"data":[56],"reorganization,":[57],"i.e.,":[58],"no":[59,192],"can":[61],"be":[62,81,121],"moved":[63],"from":[64,93],"bin":[66,95],"to":[67,91,96],"another.":[68],"In":[69,173],"paper,":[71],"first":[72,124,189],"all,":[74],"\"Relaxed\"":[76],"model":[79,84],"will":[80,120],"formalized;":[82],"allows":[85],"constant":[87,169],"move":[92],"another,":[97],"as":[98,177,201,203],"consequence":[100],"arrival":[103,182],"new":[106,115,185],"element.":[108],"Then,":[109],"context":[112],"model,":[116],"two":[117],"algorithms":[119,222,237,245,260],"described.":[122],"presents":[125],"linear":[126,154,252],"time":[127,152],"and":[128,136,153,164],"space":[129,155,253],"complexities":[130],"with":[131,157],"1.5":[133],"approximation":[134,162],"ratio":[135,163],"moves,":[137],"at":[138],"most":[139],"once,":[140],"only":[141],"\"small\"":[142],"elements;":[143],"second,":[145],"instead,":[146],"is":[147,214,277],"an":[148],"O(n":[149],"log":[150],"n)":[151],"algorithm":[156,190,256],"1.33.":[159],".":[160,161,228,229],"moves":[165,191,200],"each":[166],"times.":[172],"worst":[175],"case,":[176],"result":[179],"element,":[187],"more":[193],"than":[194,249],"three":[195],"elements,":[196],"while":[197],"second":[199],"many":[202],"seven":[204],"elements.":[205,242],"Please":[206],"note":[207],"movements":[212],"performed":[213],"explicitly":[215],"considered":[216],"complexity":[219],"analysis.":[220],"Both":[221],"are":[223,246],"below":[224],"theoretical":[226],"1.536.":[227],"lower":[230],"bound,":[231],"effective":[232],"for":[233],"movement":[240],"our":[244],"\"more":[247],"online\"":[248],"other":[251],"because,":[257],"already":[261],"known,":[262],"they":[263],"allow":[264],"return":[266],"(possibly":[269],"relevant)":[270],"fraction":[271],"before":[274],"work":[276],"carried":[278],"out.":[279]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}