Grids for cutting and packing problems: a study in the 2D knapsack problem
type: Item
instance of: scholarly article
title: Grids for cutting and packing problems: a study in the 2D knapsack problem
zbMATH Open document ID: 1468.90105
author: Jéssica Gabriela de Almeida Cunha
author: Vinícius Loti de Lima
author: Thiago Alves de Queiroz
published in: 4OR
publication date: 2021-05-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52C17
zbMATH DE Number: 7347307
zbMATH Keywords: grid of points
zbMATH Keywords: reduction procedures
zbMATH Keywords: canonical dissections
zbMATH Keywords: reduced raster points
zbMATH Keywords: meet-in-the-middle patterns
zbMATH Keywords: two-dimensional knapsack problem
MaRDI profile type: Publication
full work available at URL: s10288-019-00419-9
OpenAlex ID: W2976427446
cites work: A branch-and-cut algorithm for the pallet loading problem
cites work: A branch and bound algorithm for the strip packing problem
cites work: An exact strip packing algorithm based on canonical forms
cites work: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
cites work: The three-dimensional knapsack problem with balancing constraints
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
cites work: An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
cites work: New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
cites work: On the two-dimensional knapsack problem
cites work: Solution procedures for cutting lumber into furniture parts
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: The Meet-in-the-Middle Principle for Cutting and Packing Problems
cites work: Combinatorial Benders' Cuts for the Strip Packing Problem
cites work: An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
cites work: Extreme point-based heuristics for three-dimensional bin packing
cites work: A particular approach for the three-dimensional packing problem with additional constraints
cites work: An approximation algorithm for solving unconstrained two-dimensional knapsack problems
cites work: Q4198056
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: Three-dimensional container loading models with cargo stability and load bearing constraints
cites work: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
cites work: An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
cites work: Q3993418
cites work: The Three-Dimensional Bin Packing Problem
cites work: An exact approach to the strip-packing problem
cites work: Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
cites work: An AND/OR-graph approach to the container loading problem
cites work: Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
cites work: On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
cites work: The G4-Heuristic for the Pallet Loading Problem
cites work: Q3805803
cites work: An improved typology of cutting and packing problems
DOI: 10.1007/S10288-019-00419-9
Recommended article: An introduction to the two‐dimensional rectangular cutting and packing problem
Recommended article: 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
Recommended article: Exact solution techniques for two-dimensional cutting and packing
Recommended article: Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Recommended article: An exact method for the 2D guillotine strip packing problem
Recommended article: A Hybrid Optimization Framework for Cutting and Packing Problems
Recommended article: On the two-dimensional knapsack problem
Recommended article: Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem
Recommended article: Two-dimensional packing problems: a survey
Recommended article: Two-dimensional knapsack-block packing problem
description: scientific article; zbMATH DE number 7347307