A semi-continuous MIP model for the irregular strip packing problem

References

• Akunuru, R., and N. R. Babu. 2013. “A Semi-discrete Geometric Representation for Nesting Problems.” International Journal of Production Research 51: 4155–4174.
   Web of Science ®Google Scholar
• Alvarez-Valdes, R., A. Martinez, and J. Tamarit. 2013. “A Branch and Bound Algorithm for Cutting and Packing Irregularly Shaped Pieces.” International Journal of Production Economics 145: 463–477.
   Web of Science ®Google Scholar
• Bennell, J., and K. Dowsland. 2001. “Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting.” Management Science 47: 1160–1172.
   Web of Science ®Google Scholar
• Bennell, J. A., and J. F. Oliveira. 2008. “The Geometry of Nesting Problems: A Tutorial.” European Journal of Operational Research 184: 397–415.
   Web of Science ®Google Scholar
• Bennell, J. A., and J. F. Oliveira. 2009. “A Tutorial in Irregular Shape Packing Problems.” Journal of the Operational Research Society 60: S93–S105.
   Web of Science ®Google Scholar
• Carravilla, M. A., C. Ribeiro, and J. F. Oliveira. 2003. “Solving Nesting Problems with Non-convex Polygons by Constraint Logic Programming.” International Transactions in Operational Research 10: 651–663.
   Google Scholar
• Chernov, N., Y. Stoyan, and T. Romanova. 2010. “Mathematical Model and Efficient Algorithms for Object Packing Problem.” Computational Geometry 43: 535–553.
   Web of Science ®Google Scholar
• Daniels, K., Z. Li, and V. J. Milenkovic. 1994. “Multiple Containment Methods.” Technical Report Center for Research in Computing Technology, Division of Applied Sciences. Harvard University.
   Google Scholar
• Dean, H. T.. 2002. “Minimizing Waste in the 2-Dimensional Cutting Stock Problem.” PhD thesis, Department of Mechanical Engineering, University of Canterbury, Christchurch New Zealand.
   Google Scholar
• Fischetti, M., and I. Luzzi. 2009. “Mixed-integer Programming Models for Nesting Problems.” Journal of Heuristics 15: 201–226.
   Web of Science ®Google Scholar
• Gomes, A., and J. F. Oliveira. 2006. “Solving Irregular Strip Packing Problems by Hybridising Simulated Annealing and Linear Programming.” European Journal of Operational Research 171: 811–829.
   Web of Science ®Google Scholar
• Imamichi, T., M. Yagiura, and H. Nagamochi. 2009. “An Iterated Local Search Algorithm Based on Nonlinear Programming for the Irregular Strip Packing Problem.” Discrete Optimization 6: 345–361.
   Web of Science ®Google Scholar
• Jones, D. R. 2014. “A Fully General, Exact Algorithm for Nesting Irregular Shapes.” Journal of Global Optimization 59: 367–404.
   Web of Science ®Google Scholar
• Li, Z., and V. Milenkovic. 1995. “Compaction and Separation Algorithms for Nonconvex Polygons and their Applications.” European Journal of Operational Research 84: 539–561.
   Web of Science ®Google Scholar
• Ma, H., and C.-C. Liu. 2007. “Two-dimensional Profile-packing Approach for Multi-torch Flame Cutting.” International Journal of Production Research 45: 2841–2857.
   Web of Science ®Google Scholar
• Saravanan, K. S., A. Rajasekhar, and N. R. Babu. 2012. “An Efficient Collision Avoidance and Neighborhood Search Algorithm for Nesting of Two-dimensional Parts in Two-dimensional Sheets.” Journal of Advanced Manufacturing Systems 11: 51–65.
   Google Scholar
• Scheithauer, G., and J. Terno. 1993. “Modeling of Packing Problems.” Optimization 28: 63–84.
   Google Scholar
• Stoyan, Y., M. Novozhilova, and A. Kartashov. 1996. “Mathematical Model and Method of Searching for a Local Extremum for the Non-convex Oriented Polygons Allocation Problem.” European Journal of Operational Research 92: 193–210.
   Web of Science ®Google Scholar
• Stoyan, Y. G., M. V. Zlotnik, and A. Chugay. 2012. “Solving an Optimization Packing Problem of Circles and Non-convex Polygons with Rotations into a Multiply Connected Region.” Journal of the Operational Research Society 63: 379–391.
   Web of Science ®Google Scholar
• Toledo, F. M. B., M. A. Carravilla, C. Ribeiro, J. F. Oliveira, and A. M. Gomes. 2013. “The Dotted-board Model: A New MIP Model for the Nesting Problem.” International Journal of Production Economics 145: 478–487.
   Web of Science ®Google Scholar
• Wäscher, G., H. Haußner, and H. Schumann. 2007. “An Improved Typology of Cutting and Packing Problems.” European Journal of Operational Research 183: 1109–1130.
   Web of Science ®Google Scholar