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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20488 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012963530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations of robust mixed 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-layer MPLS network design: The impact of statistical multiplexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multiple Knapsack Problems by Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted Cover Inequalities for 0-1 Integer Programs: Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust approach to the chance-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable algorithms for chance-constrained combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach to the Bandwidth Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on robust 0-1 optimization with uncertain cost coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily Computable Facets of the Knapsack Polytope / rank
 
Normal rank

Revision as of 08:18, 5 July 2024

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