{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:16:49Z","timestamp":1774415809205,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319114200","type":"print"},{"value":"9783319114217","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11421-7_4","type":"book-chapter","created":{"date-parts":[[2014,9,24]],"date-time":"2014-09-24T06:09:06Z","timestamp":1411538946000},"page":"47-60","source":"Crossref","is-referenced-by-count":13,"title":["Approximate Circle Packing in a Rectangular Container: Integer Programming Formulations and Valid Inequalities"],"prefix":"10.1007","author":[{"given":"Igor","family":"Litvinchev","sequence":"first","affiliation":[]},{"given":"Luis","family":"Infante","sequence":"additional","affiliation":[]},{"given":"Edith Lucero","family":"Ozuna Espinosa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1016\/j.cor.2012.11.025","volume":"40","author":"H. Akeb","year":"2013","unstructured":"Akeb, H., Hifi, M.: Solving the circular open dimension problem using separate beams and look-ahead strategies. Computers & Operations Research\u00a040, 1243\u20131255 (2013)","journal-title":"Computers & Operations Research"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1504\/IJOR.2006.009300","volume":"1","author":"E. Baltacioglu","year":"2006","unstructured":"Baltacioglu, E., Moore, J.T., Hill, R.R.: The distributor\u00b4s three-dimensional pallet-packing problem: a human intelligence-based heuristic approach. International Journal of Operational Research\u00a01, 249\u2013266 (2006)","journal-title":"International Journal of Operational Research"},{"key":"4_CR3","doi-asserted-by":"publisher","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. Operations Research\u00a033, 49\u201364 (1985)","journal-title":"Operations Research"},{"key":"4_CR4","doi-asserted-by":"publisher","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. Computers & Operations Research\u00a033, 3535\u20133548 (2006)","journal-title":"Computers & Operations Research"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1016\/j.cor.2009.09.017","volume":"37","author":"E.G. Birgin","year":"2010","unstructured":"Birgin, E.G., Gentil, J.M.: New and improved results for packing identical unitary radius circles within triangles, rectangles and strips. Computers & Operations Research\u00a037, 1318\u20131327 (2010)","journal-title":"Computers & Operations Research"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ejor.2007.01.054","volume":"191","author":"I. Castillo","year":"2008","unstructured":"Castillo, I., Kampas, F.J., Pinter, J.D.: Solving circle packing problems by global optimization: Numerical results and industrial applications. European Journal of Operational Research\u00a0191, 786\u2013802 (2008)","journal-title":"European Journal of Operational Research"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"2901","DOI":"10.1016\/j.dam.2013.06.008","volume":"161","author":"A. Costa","year":"2013","unstructured":"Costa, A.: Valid constraints for the point packing in a square problem. Discrete Applied Mathematics\u00a0161, 2901\u20132909 (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Fasano, G.: Solving Non-standard Packing Problems by Global Optimization and Heuristics. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-05005-8"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/0377-2217(94)90410-3","volume":"77","author":"H.J. Frazer","year":"1994","unstructured":"Frazer, H.J., George, J.A.: Integrated container loading software for pulp and paper industry. European Journal of Operational Research\u00a077, 466\u2013474 (1994)","journal-title":"European Journal of Operational Research"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.ejor.2013.04.050","volume":"230","author":"S.I. Galiev","year":"2013","unstructured":"Galiev, S.I., Lisafina, M.S.: Linear models for the approximate solution of the problem of packing equal circles into a given domain. European Journal of Operational Research\u00a0230, 505\u2013514 (2013)","journal-title":"European Journal of Operational Research"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/0377-2217(95)00032-L","volume":"84","author":"J.A. George","year":"1995","unstructured":"George, J.A., George, J.M., Lamar, B.W.: Packing different\u2013sized circles into a rectangular container. European Journal of Operational Research\u00a084, 693\u2013712 (1995)","journal-title":"European Journal of Operational Research"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1057\/jors.1996.139","volume":"47","author":"J.A. George","year":"1996","unstructured":"George, J.A.: Multiple container packing: a case study of pipe packing. Journal of the Operational Research Society\u00a047, 1098\u20131109 (1996)","journal-title":"Journal of the Operational Research Society"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Hifi, M., M\u2019Hallah, R.: A literature review on circle and sphere packing problems: Models and methodologies. Advances in Operations Research Article ID 150624, 22 pages (2009), doi:10.1155\/2009\/150624","DOI":"10.1155\/2009\/150624"},{"key":"4_CR14","unstructured":"Litvinchev, I., Ozuna, E.L.: Packing circles in a rectangular container. In: Proc. Intl. Congr. on Logistics and Supply Chain, Queretaro, Mexico, pp. 24\u201325 (October 2013)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Litvinchev, I., Ozuna, E.L.: Integer programming formulations for approximate packing circles in a rectangular container. Mathematical Problems in Engineering (2014), doi:10.1155\/2014\/317697","DOI":"10.1155\/2014\/317697"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10878-008-9196-3","volume":"19","author":"I. Litvinchev","year":"2010","unstructured":"Litvinchev, I., Rangel, S., Saucedo, J.: A Lagrangian bound for many-to-many assignment problem. Journal of Combinatorial Optimization\u00a019, 241\u2013257 (2010)","journal-title":"Journal of Combinatorial Optimization"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.ejor.2011.04.024","volume":"214","author":"C.O. Lopez","year":"2011","unstructured":"Lopez, C.O., Beasley, J.E.: A heuristic for the circle packing problem with a variety of containers. European Journal of Operational Research\u00a0214, 512\u2013525 (2011)","journal-title":"European Journal of Operational Research"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.cor.2012.11.022","volume":"40","author":"C.O. Lopez","year":"2013","unstructured":"Lopez, C.O., Beasley, J.E.: Packing unequal circles using formulation space search. Computers & Operations Research\u00a040, 1276\u20131288 (2013)","journal-title":"Computers & Operations Research"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1111\/j.1475-3995.2012.00859.x","volume":"20","author":"Y.G. Stoyan","year":"2013","unstructured":"Stoyan, Y.G., Yaskov, G.N.: Packing congruent spheres into a multi-connected polyhedral domain. International Transactions in Operational Research\u00a020, 79\u201399 (2013)","journal-title":"International Transactions in Operational Research"},{"key":"4_CR20","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11421-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T23:46:42Z","timestamp":1559000802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11421-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319114200","9783319114217"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11421-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}