Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571)
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: Comparative analysis of linear programming relaxations for the robust knapsack problem |
scientific article; zbMATH DE number 7711820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparative analysis of linear programming relaxations for the robust knapsack problem |
scientific article; zbMATH DE number 7711820 |
Statements
Comparative analysis of linear programming relaxations for the robust knapsack problem (English)
0 references
13 July 2023
0 references
robust knapsack problem
0 references
integer optimization models
0 references
strong formulations
0 references
linear programming relaxations
0 references
comparative analysis
0 references
0 references
0 references
0 references
0 references
0.8139371275901794
0 references
0.8119615316390991
0 references
0.8103607296943665
0 references
0.804729700088501
0 references
0.8020047545433044
0 references
