Design of rectangular packings using decoders of block structure

DOI10.1134/S0005117906060117MaRDI QIDQ2457589zbMATH OpenOpenAlexFDO

Authors E. A. Mukhacheva, D. A. Nazarov, 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

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

Recommendations

• Design of rectangular packings: Block structure-based reconstruction algorithm
• The rectangular packing problem: local optimum search methods based on block structures
• 4-block heuristic for the rectangle packing problem
• A new heuristic algorithm for rectangle packing
• Denser packings obtained in \(O(n \log \log n)\) time

Cites work

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

Cited in

(2)

• Local search of orthogonal packings using the lower bounds
• Design of rectangular packings: Block structure-based reconstruction algorithm

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

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