Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem (Q2892146)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem |
scientific article; zbMATH DE number 6047266
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem |
scientific article; zbMATH DE number 6047266 |
Statements
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
Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem (English)
0 references
