{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:14:45Z","timestamp":1759666485105},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T00:00:00Z","timestamp":1322784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s11590-011-0425-9","type":"journal-article","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T16:14:01Z","timestamp":1322842441000},"page":"375-405","source":"Crossref","is-referenced-by-count":7,"title":["Symmetry-breaking constraints for packing identical rectangles within polyhedra"],"prefix":"10.1007","volume":"7","author":[{"given":"R.","family":"Andrade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. G.","family":"Birgin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,2]]},"reference":[{"key":"425_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J.E. Beasley","year":"1985","unstructured":"Beasley J.E.: An exact two-dimensional non-guillotine cutting tree-search procedure. Oper. Res. 33, 49\u201364 (1985)","journal-title":"Oper. Res."},{"key":"425_CR2","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.cie.2010.07.004","volume":"59","author":"E.G. Birgin","year":"2010","unstructured":"Birgin E.G., Lobato R.D.: Orthogonal packing of identical rectangles within isotropic convex regions. Comput. Ind. Eng. 59, 595\u2013602 (2010)","journal-title":"Comput. Ind. Eng."},{"key":"425_CR3","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1057\/jors.2008.141","volume":"61","author":"E.G. Birgin","year":"2010","unstructured":"Birgin E.G., Lobato R.D., Morabito R.: An effective recursive partitioning approach for the packing of identical rectangles in a rectangle. J. Oper. Res. Soc. 61, 306\u2013320 (2010)","journal-title":"J. Oper. Res. Soc."},{"key":"425_CR4","doi-asserted-by":"crossref","unstructured":"Birgin, E.G., Lobato, R.D., Morabito, R.: Generating unconstrained two-dimensional non-guillotine cutting patterns by a recursive partitioning algorithm. J. Oper. Res. Soc. doi: 10.1057\/jors.2011.6","DOI":"10.1057\/jors.2011.6"},{"key":"425_CR5","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1057\/palgrave.jors.2602067","volume":"57","author":"E.G. Birgin","year":"2006","unstructured":"Birgin E.G., Mart\u00ednez J.M., Mascarenhas W.F., Ronconi D.P.: Method of sentinels for packing items within arbitrary convex regions. J. Oper. Res. Soc. 57, 735\u2013746 (2006)","journal-title":"J. Oper. Res. Soc."},{"key":"425_CR6","doi-asserted-by":"crossref","first-page":"1448","DOI":"10.1057\/palgrave.jors.2601960","volume":"56","author":"E.G. Birgin","year":"2005","unstructured":"Birgin E.G., Morabito R., Nishihara F.H.: A note on an L-approach for solving the manufacturer\u2019s pallet loading problem. J. Oper. Res. Soc. 56, 1448\u20131451 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"425_CR7","doi-asserted-by":"crossref","first-page":"3535","DOI":"10.1016\/j.cor.2005.03.031","volume":"33","author":"E.G. Birgin","year":"2006","unstructured":"Birgin E.G., Mart\u00ednez J.M., Nishihara F.H., Ronconi D.P.: Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Comput. Oper. Res. 33, 3535\u20133548 (2006)","journal-title":"Comput. Oper. Res."},{"key":"425_CR8","first-page":"262","volume-title":"Minimax and Applications","author":"F. Cao","year":"1995","unstructured":"Cao F., Du D.-Z., Gao B., Wan P.-J., Pardalos P.M.: Minimax problems in combinatorial optimization. In: Du, D.-Z., Pardalos, P.M. (eds) Minimax and Applications, pp. 262\u2013285. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"425_CR9","doi-asserted-by":"crossref","first-page":"1342","DOI":"10.1016\/j.cor.2010.12.001","volume":"38","author":"A. Cassioli","year":"2011","unstructured":"Cassioli A., Locatelli M.: A heuristic approach for packing identical rectangles in convex regions. Comput. Oper. Res. 38, 1342\u20131350 (2011)","journal-title":"Comput. Oper. Res."},{"key":"425_CR10","volume-title":"Encyclopedia of Optimization","year":"2009","unstructured":"Floudas, C.A., Pardalos, P.M. (eds): Encyclopedia of Optimization, , 2nd edn. Springer, Berlin (2009)","edition":"2"},{"key":"425_CR11","doi-asserted-by":"crossref","unstructured":"Hurkens, C.A.J., Lodi, A., Martello, S., Monaci, M., Woeginger, G.J.: Complexity and approximation of an area packing problem. Optim. Lett. doi: 10.1007\/s11590-010-0246-2 (in press)","DOI":"10.1007\/s11590-010-0246-2"},{"key":"425_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10898-007-9274-6","volume":"43","author":"J. Kallrath","year":"2009","unstructured":"Kallrath J.: Cutting circles and polygons from area-minimizing rectangles. J. Global Optim. 43, 299\u2013328 (2009)","journal-title":"J. Global Optim."},{"key":"425_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10107-002-0319-9","volume":"94","author":"A. Lodi","year":"2003","unstructured":"Lodi A., Monaci M.: Integer linear programming models for 2-staged two-dimensional Knapsack problems. Math. Program. 94, 257\u2013278 (2003)","journal-title":"Math. Program."},{"key":"425_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1590\/S1807-03022010000200008","volume":"29","author":"W.F. Mascarenhas","year":"2010","unstructured":"Mascarenhas W.F., Birgin E.G.: Using sentinels to detect intersections of convex and nonconvex polygons. Comput. Appl. Math. 29, 247\u2013267 (2010)","journal-title":"Comput. Appl. Math."},{"key":"425_CR15","first-page":"1","volume":"83","author":"J. Ostrowski","year":"2010","unstructured":"Ostrowski J., Linderoth J., Rossi F., Smirglio S.: Solving Steiner triple covering problems. Otima 83, 1\u20137 (2010)","journal-title":"Otima"},{"key":"425_CR16","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1016\/j.compchemeng.2005.04.004","volume":"29","author":"N.W. Sawaya","year":"2005","unstructured":"Sawaya N.W., Grossmann I.E.: A cutting plane method for solving linear generalized disjunctive programming problems. Comput. Chem. Eng. 29, 1891\u20131913 (2005)","journal-title":"Comput. Chem. Eng."},{"key":"425_CR17","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1016\/j.compchemeng.2007.05.003","volume":"32","author":"W. Xie","year":"2008","unstructured":"Xie W., Sahinidis N.V.: A branch-and-bound algorithm for the continuous facility layout problem. Comput. Chem. Eng. 32, 1016\u20131028 (2008)","journal-title":"Comput. Chem. Eng."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0425-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0425-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0425-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:31Z","timestamp":1559409091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0425-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,2]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["425"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0425-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,2]]}}}