Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem (Q2892146): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 02:09, 20 March 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
