The rectangular packing problem: local optimum search methods based on block structures
From MaRDI portal
Publication:1778980
DOI10.1023/B:AURC.0000014721.38981.bbzbMath1066.90110OpenAlexW2081603513MaRDI QIDQ1778980
A. S. Mukhacheva, E. A. 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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution ⋮ Design of rectangular packings using decoders of block structure ⋮ Local search of orthogonal packings using the lower bounds
This page was built for publication: The rectangular packing problem: local optimum search methods based on block structures
