{"id":"https://openalex.org/W2002739756","doi":"https://doi.org/10.1007/s10951-009-0129-5","title":"Comparing online algorithms for bin packing problems","display_name":"Comparing online algorithms for bin packing problems","publication_year":2009,"publication_date":"2009-09-11","ids":{"openalex":"https://openalex.org/W2002739756","doi":"https://doi.org/10.1007/s10951-009-0129-5","mag":"2002739756"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-009-0129-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-009-0129-5","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","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/A5023269343","display_name":"Leah Epstein","orcid":"https://orcid.org/0000-0002-6761-8521"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Leah Epstein","raw_affiliation_strings":["Department of Mathematics, University of Haifa, Haifa, Israel","Department of Mathematics, University of Haifa, Haifa, ISRAEL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":"Department of Mathematics, University of Haifa, Haifa, ISRAEL","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023065140","display_name":"Lene M. Favrholdt","orcid":"https://orcid.org/0000-0003-3054-2997"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lene M. Favrholdt","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046826313","display_name":"Jens S. Kohrt","orcid":null},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jens S. Kohrt","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023269343"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":2.0267,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.88292011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"1","first_page":"13","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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.9973999857902527,"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/competitive-analysis","display_name":"Competitive analysis","score":0.9015969038009644},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.8026082515716553},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.7652683854103088},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.7323085069656372},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6818680763244629},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.630176305770874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6147967576980591},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5626144409179688},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4593714773654938},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4161722660064697},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3843683898448944},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3734171986579895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3465050458908081},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.25307944416999817}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9015969038009644},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.8026082515716553},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.7652683854103088},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7323085069656372},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6818680763244629},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.630176305770874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6147967576980591},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5626144409179688},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4593714773654938},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4161722660064697},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3843683898448944},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3734171986579895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3465050458908081},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25307944416999817},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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":4,"locations":[{"id":"doi:10.1007/s10951-009-0129-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-009-0129-5","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/8ce17db8-8496-4cc7-afe5-5f752e73017b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/8ce17db8-8496-4cc7-afe5-5f752e73017b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Epstein, L, Favrholdt, L M & Kohrt, J S 2012, 'Comparing Online Algorithms for Bin Packing Problems', Journal of Scheduling, vol. 15, no. 1, pp. 13-21. https://doi.org/10.1007/s10951-009-0129-5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.6681","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.6681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://math.haifa.ac.il/lea/rwor_bp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.580.5136","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.580.5136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://imada.sdu.dk/~svalle/Papers/efk2009/paper.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1482409676","https://openalex.org/W1490670856","https://openalex.org/W1830700568","https://openalex.org/W1969251817","https://openalex.org/W1970376721","https://openalex.org/W2002102598","https://openalex.org/W2011670396","https://openalex.org/W2029728897","https://openalex.org/W2032887760","https://openalex.org/W2033855099","https://openalex.org/W2043862089","https://openalex.org/W2048628062","https://openalex.org/W2048905935","https://openalex.org/W2057764247","https://openalex.org/W2070091108","https://openalex.org/W2072577896","https://openalex.org/W2075354456","https://openalex.org/W2081860495","https://openalex.org/W2089269509","https://openalex.org/W2107065500","https://openalex.org/W2137326476","https://openalex.org/W2148693377","https://openalex.org/W2171709162","https://openalex.org/W2282546565","https://openalex.org/W2294302919","https://openalex.org/W2399534748","https://openalex.org/W2405501895","https://openalex.org/W4213289215","https://openalex.org/W6628784897","https://openalex.org/W6657951020","https://openalex.org/W6697001574"],"related_works":["https://openalex.org/W2042512761","https://openalex.org/W2528965749","https://openalex.org/W2107065500","https://openalex.org/W76601469","https://openalex.org/W4235035380","https://openalex.org/W2971368033","https://openalex.org/W2070091108","https://openalex.org/W4288363420","https://openalex.org/W1830700568","https://openalex.org/W1590563747"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}