Grids for cutting and packing problems: a study in the 2D knapsack problem
From MaRDI portal
Publication:2025135
DOI10.1007/s10288-019-00419-9zbMath1468.90105OpenAlexW2976427446MaRDI QIDQ2025135
Jéssica Gabriela de Almeida Cunha, Vinícius Loti de Lima, Thiago Alves de Queiroz
Publication date: 11 May 2021
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-019-00419-9
reduction procedurestwo-dimensional knapsack problemcanonical dissectionsgrid of pointsmeet-in-the-middle patternsreduced raster points
Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
Logistic constraints in container loading problems: the impact of complete shipment conditions, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery, A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands, Exact approaches for the unconstrained two-dimensional cutting problem with defects, Cargo securing under multi-drop and axle weight constraints, Dynamic scheduling of patients in emergency departments, Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact strip packing algorithm based on canonical forms
- The three-dimensional knapsack problem with balancing constraints
- A particular approach for the three-dimensional packing problem with additional constraints
- A branch and bound algorithm for the strip packing problem
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Solution procedures for cutting lumber into furniture parts
- On the two-dimensional knapsack problem
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- A branch-and-cut algorithm for the pallet loading problem
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- An Exact Approach to the Strip-Packing Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Combinatorial Benders' Cuts for the Strip Packing Problem
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- The Three-Dimensional Bin Packing Problem
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- The G4-Heuristic for the Pallet Loading Problem
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- An AND/OR-graph approach to the container loading problem
- An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
