The rectangular packing problem: local optimum search methods based on block structures

DOI10.1023/B:AURC.0000014721.38981.BBMaRDI QIDQ1778980zbMATH OpenOpenAlexFDO

Authors E. A. Mukhacheva, A. S. Mukhacheva

Publication date 17 June 2005

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

Full work available at URL https://doi.org/10.1023/b:aurc.0000014721.38981.bb

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Local search algorithms for the rectangle packing problem with general spatial costs
• An efficient deterministic optimization approach for rectangular packing problems
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• A finite method of searching for the global minimum of the rectangular packing problem
• Solving the rectangular packing problem by a new bottom-left placement method incorporated with a multi-start local search
• Publication:4424328
• Efficient implementations of construction heuristics for the rectilinear block packing problem
• Design of rectangular packings: Block structure-based reconstruction algorithm

Cited in

(19)

• Polynomial solvability of special problems of disjunctive programming
• Local search of orthogonal packings using the lower bounds
• Local search algorithms for the rectangle packing problem with general spatial costs
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• Global optimization for the three-dimensional open-dimension rectangular packing problem
• Design of rectangular packings using decoders of block structure
• A Local Optimization-based Solution to the Rectangle Layout Problem
• Algorithms for the solution of the problem of placing rectangles in a rectangular area
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• A heuristic approach for packing identical rectangles in convex regions
• Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
• scientific article; zbMATH DE number 4091172 (Why is no real title available?)
• Solving the rectangular packing problem by a new bottom-left placement method incorporated with a multi-start local search
• Design of rectangular packings: Block structure-based reconstruction algorithm
• Efficient implementations of construction heuristics for the rectilinear block packing problem
• Differential evolution algorithm with moving collected points placement for 2D rectangle packing problem
• A finite method of searching for the global minimum of the rectangular packing problem

This page was built for publication: The rectangular packing problem: local optimum search methods based on block structures

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