Packing Grid Figures

  • Joachim Wolffram
Conference paper


A not necessarily connected figure consisting of non-overlapping unit squares is called a grid figure, e.g., every polyomino is a grid figure. Given a set of grid figures with associated values and a region, which is also represented as a grid figure, we consider the problem of packing grid figures of the given set in a non-overlapping way into the region subject to lower and upper quantity restrictions. The objective is to maximize the total value of the inserted grid figures.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Beasley, J.E.: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure; Operations Research 1985, 49–64Google Scholar
  2. [2]
    Camerini, P.M.; Fratta, L.; Maffioli, F.: On Improving Relaxation Methods by Modified Gradient Techniques; Mathematical Programming Study 3/1975, 26–34CrossRefGoogle Scholar
  3. [3]
    Fowler, R.J.; Paterson, M.S.; Tanimoto, L.: Optimal Packing and Covering in the Plane are NP-Complete; Information Processing Letters Vo1.l2, No.3, 1981, 133–137CrossRefGoogle Scholar
  4. [4]
    Glover, F.: Tabu Search: A Tutorial; Interfaces (1990), 20(4), 74–94CrossRefGoogle Scholar
  5. [5]
    Hinxman, A.I.: The trim-loss and assortment problems: A Survey; European Journal of Operational Research 5/1980, 8–18CrossRefGoogle Scholar
  6. [6]
    Meyer, B.: Object Oriented Software Construction; Prentice Hall, 1988Google Scholar
  7. [7]
    Wolffram,J.: Packing Grid Figures: Exact Algorithms, Heuristics, and Object Oriented Implementation; Internal Report; Lehrstuhl fur Anwendungen des Operations Research, Universität Karlsruhe, GermanyGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Joachim Wolffram
    • 1
  1. 1.Lehrstuhl für Anwendungen des Operations ResearchUniversität KarlsruheKarlsruheGermany

Personalised recommendations