Design of rectangular packings using decoders of block structure

DOI10.1134/S0005117906060117zbMath1120.52300OpenAlexW2009881231MaRDI QIDQ2457589

D. A. Nazarov, E. A. Mukhacheva, A. S. Filippova

Publication date: 23 October 2007

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117906060117

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Decoding (94B35)

Related Items (1)

Local search of orthogonal packings using the lower bounds

Cites Work

• On genetic algorithms for the packing of polygons
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• The rectangular packing problem: local optimum search methods based on block structures
• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• A typology of cutting and packing problems
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Two-Dimensional Finite Bin-Packing Algorithms

This page was built for publication: Design of rectangular packings using decoders of block structure