The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
From MaRDI portal
Publication:2669629
DOI10.1016/j.cor.2021.105521OpenAlexW3196253662MaRDI QIDQ2669629
Julio Siluk, Elsa Silva, Matheus Francescatto, Alvaro Neuenfeldt Júnior, Carmen Brum Rosa
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105521
Related Items (2)
An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Cargo securing under multi-drop and axle weight constraints
Uses Software
Cites Work
- A block-based layer building approach for the 2D guillotine strip packing problem
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- Heuristics for the strip packing problem with unloading constraints
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- Online square packing with gravity
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- Reactive GRASP for the strip-packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A branch and bound algorithm for the strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Guillotineable bin packing: A genetic approach
- On genetic algorithms for the packing of polygons
- Some experiments with simulated annealing techniques for packing problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Exact algorithms for the guillotine strip cutting/packing problem.
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- Models and bounds for two-dimensional level packing problems
- A new upper bound for the online square packing problem in a strip
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Order and static stability into the strip packing problem
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Heuristics for the score-constrained strip-packing problem
- Constraints in container loading -- a state-of-the-art review
- Exhaustive approaches to 2D rectangular perfect packings
- Triple-solution approach for the strip packing problem with two-staged patterns
- Two-dimensional strip packing with unloading constraints
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- The two-dimensional bin packing problem with variable bin sizes and costs
- An improved typology of cutting and packing problems
- A two-dimensional strip cutting problem with sequencing constraint
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- Resolution of strip-packing problems with genetic algorithms
- Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- An Algorithm for Two-Dimensional Cutting Problems
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- Hardness of Approximation for Strip Packing
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- Data set generation for rectangular placement problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
This page was built for publication: The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
