A New Linear Programming Approach to the Cutting Stock Problem (Q3929394): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434569649
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1287/opre.29.6.1092 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/opre.29.6.1092 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152147252 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/OPRE.29.6.1092 / rank
 
Normal rank

Latest revision as of 00:15, 22 December 2024

scientific article
Language Label Description Also known as
English
A New Linear Programming Approach to the Cutting Stock Problem
scientific article

    Statements

    A New Linear Programming Approach to the Cutting Stock Problem (English)
    0 references
    0 references
    1981
    0 references
    one-dimensional cutting stock problem
    0 references
    dynamic use of simply structured cutting patterns
    0 references
    large number of order lengths
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references