Integer linear programming for a cutting problem in the wood-processing industry: a case study (Q3401328): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The one-dimensional cutting stock problem with usable leftover - a heuristic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Trim Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on handling residual lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional cutting stock optimization in consecutive time periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank

Latest revision as of 09:54, 2 July 2024

scientific article
Language Label Description Also known as
English
Integer linear programming for a cutting problem in the wood-processing industry: a case study
scientific article

    Statements

    Integer linear programming for a cutting problem in the wood-processing industry: a case study (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    one-dimensional cutting
    0 references
    integer linear programming
    0 references
    wood-processing industry
    0 references

    Identifiers