A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
From MaRDI portal
Publication:306089
DOI10.1007/s10878-015-9961-zzbMath1354.90116OpenAlexW1901908750MaRDI QIDQ306089
F. Blanchet-Sadri, M. Dambrine
Publication date: 31 August 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9961-z
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Cites Work
- A new heuristic algorithm for rectangle packing
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- A branch and bound algorithm for the strip packing problem
- Exact algorithms for the guillotine strip cutting/packing problem.
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A pure quasi-human algorithm for solving the cuboid packing problem
- A caving degree approach for the single container loading problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- Approximation schemes for covering and packing problems in image processing and VLSI
- An Algorithm for Two-Dimensional Cutting Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Computational Science - ICCS 2004
