Using Different Norms in Packing Circular Objects

1. Akeb, H., Hifi, M.: Solving the circular open dimension problem using separate beams and look-ahead strategies. Computers & Operations Research 40, 1243–1255 (2013)

   Article  MathSciNet  Google Scholar 

2. Baltacioglu, E., Moore, J.T., Hill, R.R.: The distributor’s three-dimensional pallet-packing problem: a human-based heuristical approach. International Journal of Operations Research 1, 249–266 (2006)

   Article  MATH  Google Scholar 

3. Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33, 49–64 (1985)

   Article  MATH  MathSciNet  Google Scholar 

4. Birgin, E.G., Gentil, J.M.: New and improved results for packing identical unitary radius circles within triangles, rectangles and strips. Computers & Operations Research 37, 1318–1327 (2010)

   Article  MATH  MathSciNet  Google Scholar 

5. 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 191, 786–802 (2008)

   Article  MATH  MathSciNet  Google Scholar 

6. Correia, M.H., Oliveira, J.F., Ferreira, J.S.: Cylinder packing by simulated annealing. Pesquisa Operacional 20, 269–286 (2000)

   Article  MATH  Google Scholar 

7. Fasano, G.: Solving Non-standard Packing Problems by Global Optimization and Heuristics. Springer (2014)

   Google Scholar 

8. Frazer, H.J., George, J.A.: Integrated container loading software for pulp and paper industry. European Journal of Operational Research 77, 466–474 (1994)

   Article  Google Scholar 

9. 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 230, 505–514 (2013)

   Article  MathSciNet  Google Scholar 

10. George, J.A., George, J.M., Lamar, B.W.: Packing different–sized circles into a rectangular container. European Journal of Operational Research 84, 693–712 (1995)

    Article  MATH  Google Scholar 

11. George, J.A.: Multiple container packing: a case study of pipe packing. Journal of the Operational Research Society 47, 1098–1109 (1996)

    Article  MATH  Google Scholar 

12. Hifi, M., M’Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Advances in Operations Research, Article ID 150624 (2009). doi:10.1155/2009/150624

13. Litvinchev, I., Rangel, S., Mata, M., Saucedo, J.: Studying properties of Lagrangian bounds for many-to-many assignment problems. Journal of Computer and Systems Sciences International 48, 363–369 (2009)

    Article  MathSciNet  Google Scholar 

14. Litvinchev, I., Ozuna, L.: Packing circles in a rectangular container. In: Proc. Intl. Congr. on Logistics and Supply Chain, Queretaro, Mexico, pp. 24–30, October 2013

    Google Scholar 

15. Litvinchev, I., Ozuna, L.: Integer programming formulations for approximate packing circles in a rectangular container. Mathematical Problems in Engineering, Article ID 317697 (2014). doi:10.1155/2014/317697

16. Litvinchev, I., Ozuna, L.: Approximate packing circles in a rectangular container: valid inequalities and nesting. Journal of Applied Research and Technologies 12, 716–723 (2014)

    Article  Google Scholar 

17. Litvinchev, I., Infante, L., Ozuna Espinosa, E.L.: Approximate circle packing in a rectangular container: integer programming formulations and valid inequalities. In: González-Ramírez, R.G., Schulte, F., Voß, S., Ceroni Díıaz, J.A. (eds.) ICCL 2014. LNCS, vol. 8760, pp. 47–60. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

18. Lopez, C.O., Beasley, J.E.: A heuristic for the circle packing problem with a variety of containers. European Journal of Operational Research 214, 512–525 (2011)

    Article  MATH  MathSciNet  Google Scholar 

19. Lopez, C.O., Beasley, J.E.: Packing unequal circles using formulation space search. Computers & Operations Research 40, 1276–1288 (2013)

    Article  MathSciNet  Google Scholar 

20. Stoyan, Y.G., Yaskov, G.N.: Packing congruent spheres into a multi-connected polyhedral domain. International Transactions in Operational Research 20, 79–99 (2013)

    Article  MATH  MathSciNet  Google Scholar 

21. Toledo, F.M.B., Carravilla, M.A., Ribero, C., Oliveira, J.F., Gomes, A.M.: The Dotted-Board Model: A new MIP model for nesting irregular shapes. Int. J. Production Economics 145, 478–487 (2013)

    Article  Google Scholar 

22. Wang, J.: Packing of unequal spheres and automated radiosurgical treatment planning. Journal of Combinatorial Optimization 3, 453–463 (1999)

    Article  MATH  MathSciNet  Google Scholar 

23. Wolsey, L.A.: Integer Programming. Wiley, New York (1999)

    Google Scholar 

Download references