A polyhedral study of the cardinality constrained knapsack problem (Q1404231): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-003-0420-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2910445340 / rank | |||
Normal rank | |||
Latest revision as of 17:42, 21 March 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
