Janos Balogh, Gyorgy Dosa, Lars Magnus Hvattum, Tomas Attila Olaj, Istvan Szalkai, Zsolt Tuza
{"title":"用连续的正方形覆盖一个正方形","authors":"Janos Balogh, Gyorgy Dosa, Lars Magnus Hvattum, Tomas Attila Olaj, Istvan Szalkai, 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, Gyorgy Dosa, Lars Magnus Hvattum, Tomas Attila Olaj, Istvan Szalkai, 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}
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.
期刊介绍:
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.