Tighter relaxations for the cutting stock problem (Q1806682)

From MaRDI portal
Revision as of 08:59, 29 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Tighter relaxations for the cutting stock problem
scientific article

    Statements

    Tighter relaxations for the cutting stock problem (English)
    0 references
    0 references
    0 references
    0 references
    8 November 1999
    0 references
    linear programming relaxation
    0 references
    cutting stock problem
    0 references
    integer linear programming
    0 references
    integer round-up property
    0 references

    Identifiers