用连续的正方形覆盖一个正方形

IF 4.5 3区 管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Janos Balogh, Gyorgy Dosa, Lars Magnus Hvattum, Tomas Attila Olaj, Istvan Szalkai, Zsolt Tuza
{"title":"用连续的正方形覆盖一个正方形","authors":"Janos Balogh,&nbsp;Gyorgy Dosa,&nbsp;Lars Magnus Hvattum,&nbsp;Tomas Attila Olaj,&nbsp;Istvan Szalkai,&nbsp;Zsolt Tuza","doi":"10.1007/s10479-025-06633-5","DOIUrl":null,"url":null,"abstract":"<div><p>In this article we address the following problem. Given are a <span>\\(1\\times 1\\)</span> square, a <span>\\(2\\times 2\\)</span> square, and so on, finally a <span>\\(n\\times n\\)</span> square. What is the biggest square that can be <i>covered</i> completely by this given set of “small” squares? It is assumed that the small squares must stand parallel to the sides of the big square, and overlap is allowed. In contrast to the <i>packing</i> version of the problem (asking for the smallest square that can accommodate all small squares without overlap) which has been studied in several papers since the 1960’s, the covering version of the problem seems new. We construct optimal coverings for small values of <i>n</i>. For moderately bigger <i>n</i> values we solve the problem optimally by a commercial mathematical programming solver, and for even bigger <i>n</i> values we give a heuristic algorithm that can find near optimal solutions. We also provide an expansion-algorithm, that from a given good cover using consecutive squares up to size <i>n</i>, can generate a cover for a larger square using small squares up to size <span>\\(n+1\\)</span>. Finally we prove that a simple covering policy can generate an asymptotically optimal covering.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"350 3","pages":"911 - 926"},"PeriodicalIF":4.5000,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06633-5.pdf","citationCount":"0","resultStr":"{\"title\":\"Covering a square with consecutive squares\",\"authors\":\"Janos Balogh,&nbsp;Gyorgy Dosa,&nbsp;Lars Magnus Hvattum,&nbsp;Tomas Attila Olaj,&nbsp;Istvan Szalkai,&nbsp;Zsolt Tuza\",\"doi\":\"10.1007/s10479-025-06633-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this article we address the following problem. Given are a <span>\\\\(1\\\\times 1\\\\)</span> square, a <span>\\\\(2\\\\times 2\\\\)</span> square, and so on, finally a <span>\\\\(n\\\\times n\\\\)</span> square. What is the biggest square that can be <i>covered</i> completely by this given set of “small” squares? It is assumed that the small squares must stand parallel to the sides of the big square, and overlap is allowed. In contrast to the <i>packing</i> version of the problem (asking for the smallest square that can accommodate all small squares without overlap) which has been studied in several papers since the 1960’s, the covering version of the problem seems new. We construct optimal coverings for small values of <i>n</i>. For moderately bigger <i>n</i> values we solve the problem optimally by a commercial mathematical programming solver, and for even bigger <i>n</i> values we give a heuristic algorithm that can find near optimal solutions. We also provide an expansion-algorithm, that from a given good cover using consecutive squares up to size <i>n</i>, can generate a cover for a larger square using small squares up to size <span>\\\\(n+1\\\\)</span>. Finally we prove that a simple covering policy can generate an asymptotically optimal covering.</p></div>\",\"PeriodicalId\":8215,\"journal\":{\"name\":\"Annals of Operations Research\",\"volume\":\"350 3\",\"pages\":\"911 - 926\"},\"PeriodicalIF\":4.5000,\"publicationDate\":\"2025-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s10479-025-06633-5.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10479-025-06633-5\",\"RegionNum\":3,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://link.springer.com/article/10.1007/s10479-025-06633-5","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们将解决以下问题。给定一个\(1\times 1\)正方形,一个\(2\times 2\)正方形,依此类推,最后是一个\(n\times n\)正方形。能被这组给定的“小”正方形完全覆盖的最大正方形是什么?假设小正方形必须与大正方形的两边平行,并且允许重叠。与自20世纪60年代以来已经在几篇论文中研究的问题的包装版本(要求最小的正方形可以容纳所有小正方形而不重叠)相比,覆盖版本的问题似乎是新的。对于较小的n值,我们构造最优覆盖。对于中等较大的n值,我们通过商业数学规划求解器最优地解决问题,对于更大的n值,我们给出一个启发式算法,可以找到接近最优解。我们还提供了一种扩展算法,从使用大小为n的连续正方形的给定良好覆盖物,可以使用大小为\(n+1\)的小正方形生成更大正方形的覆盖物。最后证明了一个简单的覆盖策略可以产生一个渐近最优覆盖。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Covering a square with consecutive squares

In this article we address the following problem. Given are a \(1\times 1\) square, a \(2\times 2\) square, and so on, finally a \(n\times n\) square. What is the biggest square that can be covered completely by this given set of “small” squares? It is assumed that the small squares must stand parallel to the sides of the big square, and overlap is allowed. In contrast to the packing version of the problem (asking for the smallest square that can accommodate all small squares without overlap) which has been studied in several papers since the 1960’s, the covering version of the problem seems new. We construct optimal coverings for small values of n. For moderately bigger n values we solve the problem optimally by a commercial mathematical programming solver, and for even bigger n values we give a heuristic algorithm that can find near optimal solutions. We also provide an expansion-algorithm, that from a given good cover using consecutive squares up to size n, can generate a cover for a larger square using small squares up to size \(n+1\). Finally we prove that a simple covering policy can generate an asymptotically optimal covering.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Annals of Operations Research
Annals of Operations Research 管理科学-运筹学与管理科学
CiteScore
7.90
自引率
16.70%
发文量
596
审稿时长
8.4 months
期刊介绍: The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications. In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信