{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:42:09Z","timestamp":1740145329741,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"HU-MATHS-IN","award":["EFOP-3.6.2-16-2017-00015"],"award-info":[{"award-number":["EFOP-3.6.2-16-2017-00015"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The problem we considered was proposed by an industrial partner. The aim is to locate light sources around a rectangular field such that the areas these illuminate cover the whole field. We assume these illuminated areas to be rectangular as well, parallel to the field. Covering an area with multiple lights is allowed. There are several types of light sources, priced differently with different sizes of their illuminated area. We aim to minimize the cost of the cover. We propose a constraint generation approach for solving this covering problem. We formulate a MIP model to locate the light sources such that a finite number of predetermined points have to be covered. The result does not necessarily solve the original problem, i.e. it does not cover the whole field. Therefore, a constraint generation model is built to calculate a non-covered point such that the first model has to improve its previous solution to cover this new point as well. If no uncovered point is found, the result is an optimal covering, thus we stop. We have also designed some set of additional constraints to exclude symmetrical solutions, to speed up the algorithm. We analyze the efficiency of the additional constraints and report some computational results in realistic settings.<\/jats:p>","DOI":"10.1007\/s10100-021-00753-6","type":"journal-article","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T08:06:48Z","timestamp":1623226008000},"page":"1129-1149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimized location of light sources to cover a rectangular region"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2487-1957","authenticated-orcid":false,"given":"Krist\u00f3f","family":"Kov\u00e1cs","sequence":"first","affiliation":[]},{"given":"Bogl\u00e1rka","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"753_CR1","unstructured":"Cplex optimizer (2020). https:\/\/www.ibm.com\/analytics\/cplexoptimizer"},{"key":"753_CR2","unstructured":"Dosa G, Hvattum LM, Olaj T, Tuza Z (2020) The board packing problem: packing rectangles into a board to maximize profit. In Pannonian conference on advances in information technology (PCIT 2020), pp 10\u201316"},{"issue":"229\u2013234","key":"753_CR3","first-page":"04","volume":"34","author":"Z Drezner","year":"1987","unstructured":"Drezner Z (1987) On the rectangular p-center problem. Naval Res Logist (NRL) 34(229\u2013234):04","journal-title":"Naval Res Logist (NRL)"},{"key":"753_CR4","unstructured":"Fourer R, Gay DM, Kernighan BW (2002) AMPL: a modeling language for mathematical programming. Cengage Learning, ISBN 0534388094. https:\/\/ampl.com\/resources\/the-ampl-book\/"},{"key":"753_CR5","doi-asserted-by":"publisher","unstructured":"Franzblau D, Kleitman D (1984) An algorithm for covering polygons with rectangles. Inf Control 63(3):164\u2013189. ISSN 0019-9958. https:\/\/doi.org\/10.1016\/S0019-9958(84)80012-1","DOI":"10.1016\/S0019-9958(84)80012-1"},{"key":"753_CR6","doi-asserted-by":"publisher","unstructured":"Huang E, Korf RE (2013) Optimal rectangle packing: an absolute placement approach. J Artif Int Res 46 (1):47\u201387. ISSN 1076-9757. https:\/\/doi.org\/10.1613\/jair.3735","DOI":"10.1613\/jair.3735"},{"key":"753_CR7","unstructured":"Iacob P, Marinescu D, Luca C (2003) Covering with rectangular pieces. Analele Universitatii \u201cOvidius\u201d Constanta - Seria Matematica, 11(2):75\u201386. https:\/\/www.anstuocmath.ro\/mathematics\/pdf6\/75_86_PIacob_DMarinescu_CLuca.pdf"},{"key":"753_CR8","doi-asserted-by":"publisher","unstructured":"Ko MT, Lee RCT, Chang JS (1990) Rectilinear m-center problem. Naval Res Logist (NRL) 37(3):419\u2013427. https:\/\/doi.org\/10.1002\/nav.3800370306","DOI":"10.1002\/nav.3800370306"},{"key":"753_CR9","doi-asserted-by":"publisher","unstructured":"Kov\u00e1cs K, G.-T\u00f3th B (2019) Rectangle covering. In: AIP conference proceedings, vol 2070, p 020036. https:\/\/doi.org\/10.1063\/1.5090003, https:\/\/aip.scitation.org\/doi\/abs\/10.1063\/1.5090003","DOI":"10.1063\/1.5090003"},{"key":"753_CR10","doi-asserted-by":"publisher","unstructured":"N\u00f6ll T, Strieker D, (2011) Efficient packing of arbitrary shaped charts for automatic texture atlas generation. Computer Graphics Forum 30(4):1309\u20131317. https:\/\/doi.org\/10.1111\/j.1467-8659.2011.01990.x.https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1111\/j.1467-8659.2011.01990.x","DOI":"10.1111\/j.1467-8659.2011.01990.x"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-021-00753-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-021-00753-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-021-00753-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T17:32:57Z","timestamp":1653586377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-021-00753-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["753"],"URL":"https:\/\/doi.org\/10.1007\/s10100-021-00753-6","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"15 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}