A polyhedral study of the cardinality constrained knapsack problem (Q1404231)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1968540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polyhedral study of the cardinality constrained knapsack problem |
scientific article; zbMATH DE number 1968540 |
Statements
A polyhedral study of the cardinality constrained knapsack problem (English)
0 references
20 August 2003
0 references
mixed-integer programming
0 references
knapsack problem
0 references
cardinality constrained programming
0 references
branch-and-cut
0 references
0.9324958
0 references
0.92945987
0 references
0.9189446
0 references
0.9159551
0 references
0.91450375
0 references
0 references
0.9046038
0 references
0.9043726
0 references
0.9028987
0 references
