Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548)

From MaRDI portal
Revision as of 03:15, 16 July 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
Partial objective inequalities for the multi-item capacitated lot-sizing problem
scientific article

    Statements

    Partial objective inequalities for the multi-item capacitated lot-sizing problem (English)
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed-integer programming
    0 references
    dynamic programming
    0 references
    cutting planes
    0 references
    valid inequalities
    0 references
    partial objective cuts
    0 references
    \((l, s)\) inequalities
    0 references
    polyhedral study
    0 references
    branch-and-cut
    0 references
    multi-item
    0 references
    capacitated lot-sizing
    0 references
    production planning
    0 references
    0 references