{"id":"https://openalex.org/W76601469","doi":null,"title":"A Three-dimensional Bin Packing Algorithm","display_name":"A Three-dimensional Bin Packing Algorithm","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W76601469","mag":"76601469"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.395.8942","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.8942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tu-dresden.de/~scheith/PREPRINTS/91-3BPP.pdf","raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"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/A5028962941","display_name":"Guntram Scheithauer","orcid":"https://orcid.org/0000-0003-4061-3357","observed_orcids":["https://orcid.org/0000-0003-4061-3357"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Guntram Scheithauer","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4061-3357","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5028962941"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":null,"first_page":"263","last_page":"271"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":1.0,"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":1.0,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/three-dimensional-bin-packing","display_name":"three-dimensional bin packing","score":0.9860000014305115},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8500000238418579},{"id":"https://openalex.org/keywords/performance-bounds","display_name":"performance bounds","score":0.9459999799728394},{"id":"https://openalex.org/keywords/two-dimensional-bin-packing","display_name":"two-dimensional bin packing","score":0.9269999861717224},{"id":"https://openalex.org/keywords/area-utilization","display_name":"area utilization","score":0.925000011920929},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7789999842643738}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9605609178543091},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.9141642451286316},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7087333798408508},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6903660297393799},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.6652634143829346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5261049866676331},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4629531502723694},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.459672749042511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40935108065605164},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08999422192573547},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.08355313539505005},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.04806649684906006}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.395.8942","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.8942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tu-dresden.de/~scheith/PREPRINTS/91-3BPP.pdf","raw_type":"text"},{"id":"mag:76601469","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eik/eik27.html#Scheithauer91","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of automata, languages and combinatorics","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1977189339","https://openalex.org/W1985246949","https://openalex.org/W1997959089","https://openalex.org/W2060747552"],"related_works":["https://openalex.org/W2101057470","https://openalex.org/W2074352498","https://openalex.org/W2009489504","https://openalex.org/W7110159508","https://openalex.org/W2081615832","https://openalex.org/W1972804506","https://openalex.org/W2403152092","https://openalex.org/W1972902146","https://openalex.org/W7097699070","https://openalex.org/W1986228108"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"an":[3],"approximation":[4],"algorithm":[5,29],"for":[6,32],"the":[7,54],"three-dimensional":[8],"bin":[9,27,38],"packing":[10,28],"problem":[11,35],"is":[12,18,30,43],"proposed":[13],"and":[14,39],"its":[15,40],"performance":[16,55],"bound":[17,24,52],"investigated.":[19],"To":[20],"obtain":[21],"such":[22],"a":[23,25,33,46,50],"modified":[26],"considered":[31],"two-dimensional":[34],"with":[36],"bounded":[37],"area":[41],"utilization":[42],"estimated.":[44],"Finally,":[45],"hard":[47],"example":[48],"gives":[49],"lower":[51],"of":[53],"bound.":[56]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}