Rectangle packing with a recursive pilot method
From MaRDI portal
Publication:6065652
DOI10.1016/j.cor.2023.106447OpenAlexW4387408964MaRDI QIDQ6065652
Vitor Pimenta dos Reis Arruda, Luiz Gustavo Bizarro Mirisola, Nei Yoshihiro Soma
Publication date: 15 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106447
Cites Work
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- A simple randomized algorithm for two-dimensional strip packing
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- A new heuristic algorithm for rectangle packing
- A least wasted first heuristic algorithm for the rectangular packing problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- An efficient deterministic heuristic for two-dimensional rectangular packing
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Exact solution techniques for two-dimensional cutting and packing
- An improved typology of cutting and packing problems
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Orthogonal Packings in Two Dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Data set generation for rectangular placement problems
This page was built for publication: Rectangle packing with a recursive pilot method
