Using pattern matching for tiling and packing problems

DOI10.1016/J.EJOR.2006.02.029MaRDI QIDQ2643924zbMATH OpenOpenAlexFDO

Authors Mahmood Amintoosi, Hadi Sadoghi Yazdi, Reza Monsefi, 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

2D cutting and packingdirection codegenetic algorithmpattern matchingstring matchingtiling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2058177
• A neuro-based optimization algorithm for tiling problems with rotation
• Polyominoes tiling by a genetic algorithm
• Solving the rectangular packing problem by a new bottom-left placement method incorporated with a multi-start local search
• A neural network approach to tiling problems

Cites work

• ``Neural computation of decisions in optimization problems
• Algorithms on Strings, Trees and Sequences
• Generating convex polyominoes at random
• scientific article; zbMATH DE number 5725179 (Why is no real title available?)
• Tiling rectangles and half strips with congruent polyominoes

Cited in

(4)

• Holey matrimony: marrying two approaches to a tiling problem
• A neuro-based optimization algorithm for tiling problems with rotation
• A neural network approach to tiling problems
• scientific article; zbMATH DE number 2058177 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643924)