An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083): 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: An Algorithm for Two-Dimensional Cutting Problems / 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: Q4398379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PackLib\(^{2}\): an integrated library of multi-dimensional packing problems / 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: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for large-scale unconstrained two and three staged cutting problems / 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: An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative numerical analysis for the guillotine two-dimensional cutting problem / 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: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. / rank
 
Normal rank

Revision as of 21:47, 12 July 2024

scientific article
Language Label Description Also known as
English
An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
scientific article

    Statements

    An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    guillotine cutting
    0 references
    knapsack function
    0 references
    dynamic programming
    0 references

    Identifiers