Using pattern matching for tiling and packing problems

DOI10.1016/j.ejor.2006.02.029zbMath1138.05307OpenAlexW1986712800MaRDI QIDQ2643924

Reza Monsefi, Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fathy

Publication date: 27 August 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.02.029

zbMATH Keywords

tilinggenetic algorithmstring matchingpattern matching2D cutting and packingdirection code

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Cites Work

• Unnamed Item
• ``Neural computation of decisions in optimization problems
• Tiling rectangles and half strips with congruent polyominoes
• Generating convex polyominoes at random
• Algorithms on Strings, Trees and Sequences

This page was built for publication: Using pattern matching for tiling and packing problems