{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:24Z","timestamp":1740123264862,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,1,3]],"date-time":"2018-01-03T00:00:00Z","timestamp":1514937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"crossref","award":["PVE 030479\/2013-01"],"award-info":[{"award-number":["PVE 030479\/2013-01"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10479-017-2746-2","type":"journal-article","created":{"date-parts":[[2018,1,3]],"date-time":"2018-01-03T04:13:22Z","timestamp":1514952802000},"page":"831-851","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum tiling of a rectangle by squares"],"prefix":"10.1007","volume":"271","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9978-7613","authenticated-orcid":false,"given":"Michele","family":"Monaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9 Gustavo","family":"dos Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,3]]},"reference":[{"key":"2746_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J Beasley","year":"1985","unstructured":"Beasley, J. (1985). An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research, 33, 49\u201364.","journal-title":"Operations Research"},{"key":"2746_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s00453-002-0962-9","volume":"34","author":"O Beaumont","year":"2002","unstructured":"Beaumont, O., Boudet, V., Rastello, F., & Robert, Y. (2002). Partitioning a square into rectangles: NP-completeness and approximation algorithms. Algorithmica, 34, 217\u2013239.","journal-title":"Algorithmica"},{"key":"2746_CR3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J Benders","year":"1962","unstructured":"Benders, J. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"2746_CR4","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1057\/jors.2008.141","volume":"61","author":"E Birgin","year":"2010","unstructured":"Birgin, E., Lobato, R., & Morabito, R. (2010). An effective recursive partitioning approach for the packing of identical rectangles in a rectangle. Journal of the Operational Research Society, 61, 306\u2013320.","journal-title":"Journal of the Operational Research Society"},{"key":"2746_CR5","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1215\/S0012-7094-40-00718-9","volume":"7","author":"R Brooks","year":"1940","unstructured":"Brooks, R., Smith, C., Stone, A., & Tutte, W. (1940). The dissection of rectangles into squares. Duke Mathematics Journal, 7, 312\u2013340.","journal-title":"Duke Mathematics Journal"},{"key":"2746_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A Caprara","year":"2004","unstructured":"Caprara, A., & Monaci, M. (2004). On the two-dimensional knapsack problem. Operations Research Letters, 32, 5\u201314.","journal-title":"Operations Research Letters"},{"key":"2746_CR7","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1016\/j.cor.2006.08.011","volume":"35","author":"Y Cui","year":"2008","unstructured":"Cui, Y., Yang, Y., Cheng, X., & Song, P. (2008). A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. Computers and Operations Research, 35, 1281\u20131291.","journal-title":"Computers and Operations Research"},{"key":"2746_CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.cor.2010.12.018","volume":"39","author":"M Dolatabadi","year":"2012","unstructured":"Dolatabadi, M., Lodi, A., & Monaci, M. (2012). Exact algorithms for the two-dimensional guillotine knapsack. Computers and Operations Research, 39, 48\u201353.","journal-title":"Computers and Operations Research"},{"key":"2746_CR9","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/opre.2013.1231","volume":"62","author":"M Fischetti","year":"2014","unstructured":"Fischetti, M., & Monaci, M. (2014). Exploiting erraticism in search. Operations Research, 62, 114\u2013122.","journal-title":"Operations Research"},{"key":"2746_CR10","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/jcta.1996.0104","volume":"76","author":"R Kenyon","year":"1996","unstructured":"Kenyon, R. (1996). Tiling a rectangle with the fewest squares. Journal of Combinatorial Theory, 76, 272\u2013291.","journal-title":"Journal of Combinatorial Theory"},{"key":"2746_CR11","doi-asserted-by":"crossref","first-page":"680","DOI":"10.2197\/ipsjjip.20.680","volume":"20","author":"S Kurz","year":"2012","unstructured":"Kurz, S. (2012). Squaring the square with integer linear programming. Journal of Information Processing, 20, 680\u2013685.","journal-title":"Journal of Information Processing"},{"key":"2746_CR12","doi-asserted-by":"crossref","first-page":"2130","DOI":"10.1287\/mnsc.1110.1416","volume":"57","author":"A Lodi","year":"2011","unstructured":"Lodi, A., Martello, S., Monaci, M., Cicconetti, C., Lenzini, L., Mingozzi, E., et al. (2011). Efficient two-dimensional packing algorithms for mobile WiMAX. Management Science, 57, 2130\u20132144.","journal-title":"Management Science"},{"key":"2746_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10107-002-0319-9","volume":"94","author":"A Lodi","year":"2013","unstructured":"Lodi, A., & Monaci, M. (2013). Integer linear programming models for 2-staged two-dimensional knapsack problems. Mathematical Programming, 94, 257\u2013278.","journal-title":"Mathematical Programming"},{"key":"2746_CR14","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.dam.2015.09.012","volume":"217","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Monaci, M., & Pietrobuoni, E. (2017). Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints. Discrete Applied Mathematics, 217, 40\u201347.","journal-title":"Discrete Applied Mathematics"},{"key":"2746_CR15","unstructured":"Lodi, M., Martello, M., Monaci, M., & Vigo, D. (2010). Two-dimensional bin packing problems. In: Paradigms of combinatorial optimization (pp. 107\u2013129). Wiley\/ISTE."},{"key":"2746_CR16","unstructured":"Lueker, G. (1975). Two NP-complete problems in nonnegative integer programming. Technical report, Report No. 178, Computer Science Laboratory, Princeton."},{"key":"2746_CR17","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S Martello","year":"2003","unstructured":"Martello, S., Monaci, M., & Vigo, D. (2003). An exact approach to the strip packing problem. INFORMS Journal on Computing, 15, 310\u2013319.","journal-title":"INFORMS Journal on Computing"},{"key":"2746_CR18","volume-title":"Knapsack problems: Algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. Chichester: Wiley."},{"key":"2746_CR19","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580682","volume":"10","author":"P Miliotis","year":"1976","unstructured":"Miliotis, P. (1976). Integer programming approaches to the travelling salesman problem. Mathematical Programming, 10, 367\u2013378.","journal-title":"Mathematical Programming"},{"key":"2746_CR20","unstructured":"Pietrobuoni, E. (2015). Two-dimensional bin packing problem with guillotine restrictions. Ph.D. thesis, University of Bologna, Bologna, Italy. http:\/\/amsdottorato.unibo.it\/6810\/."},{"key":"2746_CR21","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2010.01.039","volume":"205","author":"E Silva","year":"2010","unstructured":"Silva, E., Alvelos, F., & Valrio de Carvalho, J. (2010). An integer programming model for two- and three-stage two-dimensional cutting stock problems. European Journal of Operational Research, 205, 699\u2013708.","journal-title":"European Journal of Operational Research"},{"key":"2746_CR22","doi-asserted-by":"crossref","first-page":"2913","DOI":"10.1016\/j.disc.2008.07.028","volume":"309","author":"M Walters","year":"2009","unstructured":"Walters, M. (2009). Rectangles as sum of squares. Discrete Mathematics, 309, 2913\u20132921.","journal-title":"Discrete Mathematics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2746-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2746-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2746-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T04:38:41Z","timestamp":1542947921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2746-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,3]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2746"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2746-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2018,1,3]]}}}