Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Grids for cutting and packing problems: a study in the 2D knapsack problem |
scientific article; zbMATH DE number 7347307
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Grids for cutting and packing problems: a study in the 2D knapsack problem |
scientific article; zbMATH DE number 7347307 |
Statements
Grids for cutting and packing problems: a study in the 2D knapsack problem (English)
0 references
11 May 2021
0 references
grid of points
0 references
reduction procedures
0 references
canonical dissections
0 references
reduced raster points
0 references
meet-in-the-middle patterns
0 references
two-dimensional knapsack problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8883448
0 references
0.8827712
0 references
0.8762687
0 references
0.87513715
0 references
0.87340546
0 references
0.8729143
0 references
0.8695275
0 references
0.86879706
0 references
0.86872995
0 references
0.86757976
0 references
