Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-019-00419-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2976427446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the strip packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact strip packing algorithm based on canonical forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-dimensional knapsack problem with balancing constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective recursive partitioning approach for the packing of identical rectangles in a rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Dimensional Strip-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution procedures for cutting lumber into furniture parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Two-Dimensional Cutting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Meet-in-the-Middle Principle for Cutting and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for the Strip Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Point-Based Heuristics for Three-Dimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particular approach for the three-dimensional packing problem with additional constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for solving unconstrained two-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional container loading models with cargo stability and load bearing constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>L</i>-approach for packing (<i>ℓ</i>, <i>w</i>)-rectangles into rectangular and <i>L</i>-shaped pieces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Dimensional Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Approach to the Strip-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An AND/OR-graph approach to the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: The G4-Heuristic for the Pallet Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank

Revision as of 18:06, 25 July 2024

scientific article
Language Label Description Also known as
English
Grids for cutting and packing problems: a study in the 2D knapsack problem
scientific article

    Statements

    Grids for cutting and packing problems: a study in the 2D knapsack problem (English)
    0 references
    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

    Identifiers