An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650688 / rank
 
Normal rank
Property / zbMATH Keywords
 
guillotine cutting
Property / zbMATH Keywords: guillotine cutting / rank
 
Normal rank
Property / zbMATH Keywords
 
knapsack function
Property / zbMATH Keywords: knapsack function / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank

Revision as of 05:21, 28 June 2023

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