A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
From MaRDI portal
Publication:4483740
DOI10.15807/JORSJ.45.145zbMATH Open1027.90114OpenAlexW2110824376MaRDI QIDQ4483740FDOQ4483740
Authors: Hiroyuki Okano 
Publication date: 27 May 2003
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.45.145
Recommendations
- Two-Dimensional Finite Bin-Packing Algorithms
- An effective heuristic for the two-dimensional irregular bin packing problem
- Matheuristics for the irregular bin packing problem with free rotations
- Sequential heuristic for the two-dimensional bin-packing problem
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (5)
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- A 2D convex shapes bin packing problem in the production of laminated safety glass
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
- An effective heuristic for the two-dimensional irregular bin packing problem
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
This page was built for publication: A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4483740)
