{"id":"https://openalex.org/W1580752931","doi":"https://doi.org/10.1007/bf02246509","title":"Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms","display_name":"Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms","publication_year":1994,"publication_date":"1994-09-01","ids":{"openalex":"https://openalex.org/W1580752931","doi":"https://doi.org/10.1007/bf02246509","mag":"1580752931"},"language":"en","primary_location":{"id":"doi:10.1007/bf02246509","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02246509","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1765/71894","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110739570","display_name":"G. Galambos","orcid":null},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"G. Galambos","raw_affiliation_strings":["Department of Computer Science, JGYTF, P.O. Box 396, H-6720, Szeged, Hungary","Department of Computer Science, JGYTF, Szeged, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, JGYTF, P.O. Box 396, H-6720, Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]},{"raw_affiliation_string":"Department of Computer Science, JGYTF, Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112774631","display_name":"A. van Vliet","orcid":null},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"A. van Vliet","raw_affiliation_strings":["Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR, Rotterdam, The Netherlands","Econometric Institute Erasmus, University Rotterdam, Rotterdam, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR, Rotterdam, The Netherlands","institution_ids":["https://openalex.org/I913958620"]},{"raw_affiliation_string":"Econometric Institute Erasmus, University Rotterdam, Rotterdam, The Netherlands#TAB#","institution_ids":["https://openalex.org/I913958620"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110739570"],"corresponding_institution_ids":["https://openalex.org/I227486990"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":7.9666,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.96716997,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"52","issue":"3","first_page":"281","last_page":"297"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.9957000017166138,"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.9677465558052063},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.7808310985565186},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6601582765579224},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.572754979133606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5481536388397217},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.54152911901474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4940264821052551},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4709010422229767},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4591919481754303},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2803923487663269},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0817682147026062},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06428036093711853},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.05643737316131592},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0469127893447876}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9677465558052063},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.7808310985565186},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6601582765579224},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.572754979133606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5481536388397217},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.54152911901474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4940264821052551},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4709010422229767},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4591919481754303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2803923487663269},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0817682147026062},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06428036093711853},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.05643737316131592},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0469127893447876},{"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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf02246509","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02246509","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","raw_type":"journal-article"},{"id":"pmh:eur:oai:repub.eur.nl:71894","is_oa":true,"landing_page_url":"http://hdl.handle.net/1765/71894","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computing: archives for scientific computing, 52(3), 281 - 297","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:repub.eur.nl:71894","is_oa":true,"landing_page_url":"http://repub.eur.nl/pub/71894","pdf_url":null,"source":{"id":"https://openalex.org/S4377196287","display_name":"RePub (Erasmus University Rotterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I913958620","host_organization_name":"Erasmus University Rotterdam","host_organization_lineage":["https://openalex.org/I913958620"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computing: archives for scientific computing vol. 52 no. 3, pp. 281-297","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:eur:oai:repub.eur.nl:71894","is_oa":true,"landing_page_url":"http://hdl.handle.net/1765/71894","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computing: archives for scientific computing, 52(3), 281 - 297","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W195013014","https://openalex.org/W1586039414","https://openalex.org/W1987566992","https://openalex.org/W2011039300","https://openalex.org/W2037728500","https://openalex.org/W2039304152","https://openalex.org/W2043049421","https://openalex.org/W2055872862","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W76601469","https://openalex.org/W4235035380","https://openalex.org/W2971368033","https://openalex.org/W2026961896","https://openalex.org/W1590563747","https://openalex.org/W2056716554","https://openalex.org/W3167861864","https://openalex.org/W2963371694","https://openalex.org/W4255148175","https://openalex.org/W2949118071"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}