A Decomposition Algorithm for Nested Resource Allocation Problems (Q2810553)

From MaRDI portal
Revision as of 02:04, 12 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
A Decomposition Algorithm for Nested Resource Allocation Problems
scientific article

    Statements

    title
    A Decomposition Algorithm for Nested Resource Allocation Problems (English)
    0 references
    author
    Thibaut Vidal
    0 references
    Patrick Jaillet
    0 references
    Nelson F. Maculan
    0 references
    publication date
    3 June 2016
    0 references
    zbMATH Keywords
    separable convex optimization
    0 references
    resource allocation
    0 references
    nested constraints
    0 references
    project crashing
    0 references
    speed optimization
    0 references
    lot sizing
    0 references
    cites work
    Q3292915
    0 references
    Q4286721
    0 references
    Q3967358
    0 references

    Identifiers

    DOI
    10.1137/140965119
    0 references
    Mathematics Subject Classification ID
    90C25
    0 references
    91B32
    0 references
    52A41
    0 references
    90B06
    0 references
    90B35
    0 references
    zbMATH DE Number
    6588584
    0 references
    OpenAlex ID
    W2127223974
    0 references
    arXiv ID
    1404.6694
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2810553&oldid=36254027"
    Powered by MediaWiki