A polyhedral study of the cardinality constrained knapsack problem (Q1404231): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINTO / rank | |||
Normal rank | |||
Revision as of 12:38, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polyhedral study of the cardinality constrained knapsack problem |
scientific article |
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
