Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem (Q2892146): Difference between revisions
From MaRDI portal
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
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
0 references