Heuristic Approaches for Solving the Tetris-like Item Problem in Practice

  • Giorgio Fasano
Chapter
First Online:
Part of the SpringerBriefs in Optimization book series (BRIEFSOPTI)

Abstract

As easily gathered, the general MIP model, conceived to sort out the tetris-like item packing problem (Sect. 2.1), is usually very hard to solve. In this chapter the relevant intrinsic difficulties are examined first (Sect. 4.1). A heuristic philosophy is then emphasized to tackle efficiently the problem, even if just nonproven optimal solutions can, in general, be obtained.

This is a preview of subscription content, log in to check access.

References

  1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation (Corrected edn.). Springer, Berlin (2003). ISBN 978-3540654315Google Scholar
  2. Chlebík, M., Chlebíková, J.: Inapproximability results for orthogonal rectangle packing problems with rotations. In: Proceedings of 6th Conference on Algorithms and Complexity (CIAC 2006), LNCS, pp. 199–210. Springer, Rome, Italy (2006)Google Scholar
  3. Fasano, G.: MIP-based heuristic for non-standard 3D-packing problems. 4OR Q. J. Oper. Res. 6(3), 291–310 (2008)CrossRefMATHMathSciNetGoogle Scholar
  4. Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press, Cambridge (2008)CrossRefGoogle Scholar
  5. INFORMS Computing Society: Mathematical Programming Glossary. http://glossary.computing.society.informs.org (2010). Accessed 30 Aug 2013
  6. Weisstein, E.W.: Grid Graph. MathWorld—A Wolfram Web Resource. http://mathworld.wolfram.com/GridGraph.html (2012). Accessed 30 Aug 2013

Copyright information

© Giorgio Fasano 2014

Authors and Affiliations

  • Giorgio Fasano
    • 1
  1. 1.Engineering and Advanced StudiesThales Alenia SpaceTurinItaly

Personalised recommendations