Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem (Q2892146)

From MaRDI portal
Revision as of 12:07, 22 August 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
Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
scientific article

    Statements

    Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    robust optimization
    0 references
    knapsack set
    0 references
    polyhedral analysis
    0 references
    knapsack cover inequalities
    0 references
    routing
    0 references
    bandwidth packing problem
    0 references

    Identifiers