Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement (Q1974322)

From MaRDI portal
Revision as of 15:40, 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
Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement
scientific article

    Statements

    Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement (English)
    0 references
    0 references
    0 references
    0 references
    3 January 2001
    0 references
    A new exact solution method is described for the problem of cutting a given set of rectangular pieces out of a band of fixed width and minimal length. It is based on successive Lagrangian relaxation of a description as a disjunctive linear program. No proof of convergence to optimality, nor numerical results are given.
    0 references
    0 references
    0 references
    0 references
    0 references
    rectangle cutting
    0 references
    Lagrangian relaxation
    0 references