{"id":"https://openalex.org/W4396746818","doi":"https://doi.org/10.3390/a17050198","title":"Three Cube Packing for All Dimensions","display_name":"Three Cube Packing for All Dimensions","publication_year":2024,"publication_date":"2024-05-08","ids":{"openalex":"https://openalex.org/W4396746818","doi":"https://doi.org/10.3390/a17050198"},"language":"en","primary_location":{"id":"doi:10.3390/a17050198","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17050198","pdf_url":"https://www.mdpi.com/1999-4893/17/5/198/pdf?version=1715156650","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/17/5/198/pdf?version=1715156650","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078780649","display_name":"Peter Adamko","orcid":"https://orcid.org/0000-0001-6256-4475"},"institutions":[{"id":"https://openalex.org/I3122011922","display_name":"University of \u017dilina","ror":"https://ror.org/031wwwj55","country_code":"SK","type":"education","lineage":["https://openalex.org/I3122011922"]}],"countries":["SK"],"is_corresponding":true,"raw_author_name":"Peter Adamko","raw_affiliation_strings":["Department of Quantitative Methods and Economics Informatics, Faculty of Operation and Economics of Transport and Communications, University of \u017dilina, Univerzitn\u00e1 1, 010 26 \u017dilina, Slovakia"],"raw_orcid":"https://orcid.org/0000-0001-6256-4475","affiliations":[{"raw_affiliation_string":"Department of Quantitative Methods and Economics Informatics, Faculty of Operation and Economics of Transport and Communications, University of \u017dilina, Univerzitn\u00e1 1, 010 26 \u017dilina, Slovakia","institution_ids":["https://openalex.org/I3122011922"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078780649"],"corresponding_institution_ids":["https://openalex.org/I3122011922"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1782},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07879449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"5","first_page":"198","last_page":"198"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9987999796867371,"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/T11159","display_name":"Manufacturing Process and 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"}}],"keywords":[{"id":"https://openalex.org/keywords/cube","display_name":"Cube (algebra)","score":0.7843772768974304},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5509034991264343},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.44438934326171875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40650346875190735},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3711642622947693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34474843740463257}],"concepts":[{"id":"https://openalex.org/C53051483","wikidata":"https://www.wikidata.org/wiki/Q861555","display_name":"Cube (algebra)","level":2,"score":0.7843772768974304},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5509034991264343},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.44438934326171875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40650346875190735},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3711642622947693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34474843740463257}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a17050198","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17050198","pdf_url":"https://www.mdpi.com/1999-4893/17/5/198/pdf?version=1715156650","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:e0a6a5385a9a4e8cb09fef0ead263866","is_oa":true,"landing_page_url":"https://doaj.org/article/e0a6a5385a9a4e8cb09fef0ead263866","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 17, Iss 5, p 198 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a17050198","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17050198","pdf_url":"https://www.mdpi.com/1999-4893/17/5/198/pdf?version=1715156650","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4396746818.pdf"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W239990970","https://openalex.org/W1496335400","https://openalex.org/W1969434948","https://openalex.org/W2013986360","https://openalex.org/W2045151914","https://openalex.org/W2064729796","https://openalex.org/W2125200269","https://openalex.org/W3195490851","https://openalex.org/W4295634057"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W2378462025"],"abstract_inverted_index":{"Let":[0],"Vn(d)":[1],"denote":[2],"the":[3,44,48,105,109],"least":[4],"number,":[5],"such":[6,70],"that":[7,33,71,85],"every":[8],"collection":[9],"of":[10,28,47],"n":[11],"d-cubes":[12],"with":[13,65],"total":[14],"volume":[15,29,60],"1":[16],"in":[17],"d-dimensional":[18],"(Euclidean)":[19],"space":[20],"can":[21],"be":[22],"packed":[23],"parallelly":[24],"into":[25],"some":[26],"d-box":[27],"Vn(d).":[30],"We":[31,82],"show":[32],"V3(d)=r1\u2212dd":[34],"if":[35,39,74,80],"d\u226511":[36],"and":[37,53,76,98],"V3(d)=1r+1rd+1r\u2212rd+1":[38],"2\u2264d\u226410,":[40],"where":[41],"r":[42],"is":[43,61],"only":[45,86],"solution":[46],"equation":[49],"2(d\u22121)kd+dkd\u22121=1":[50],"on":[51,55],"22,1":[52],"(k+1)d(1\u2212k)d\u22121dk2+d+k\u22121=kddkd+1+dkd+kd+1":[54],"22,1,":[56],"respectively.":[57],"The":[58],"maximum":[59,96,106],"achieved":[62],"by":[63],"hypercubes":[64],"edges":[66],"x,":[67],"y,":[68],"z,":[69],"x=2rd+1\u22121/d,":[72],"y=z=rx":[73],"d\u226511,":[75],"x=rd+(1r\u2212r)d+1\u22121/d,":[77],"y=rx,":[78],"z=(1r\u2212r)x":[79],"2\u2264d\u226410.":[81],"also":[83],"proved":[84],"for":[87,99],"dimensions":[88,101],"less":[89],"than":[90,103],"11":[91],"are":[92],"there":[93],"two":[94,111],"different":[95],"packings,":[97],"all":[100],"greater":[102],"10,":[104],"packing":[107],"has":[108],"same":[110],"smallest":[112],"cubes.":[113]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}