Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem (Q3562403)

From MaRDI portal
Revision as of 22:46, 12 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
scientific article

    Statements

    Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem (English)
    0 references
    21 May 2010
    0 references
    production planning
    0 references
    mixed integer programming
    0 references
    branch-and-price and Dantzig-Wolfe decomposition
    0 references

    Identifiers