Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / 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: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms for three-stage two-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line algorithm for multidimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional packings with rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the approximability of cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strip packing With rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the guillotine strip cutting/packing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and bounds for two-dimensional level packing problems / 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: An asymptotic approximation algorithm for 3D-strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934715 / 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: On Packing Two-Dimensional Bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loading Multiple Pallets / rank
 
Normal rank

Revision as of 21:04, 5 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
scientific article

    Statements

    Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    guillotine cutting
    0 references
    three-dimensional cutting stock
    0 references
    unbounded knapsack
    0 references
    strip packing
    0 references
    column generation
    0 references
    0 references
    0 references

    Identifiers