Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:48, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem |
scientific article |
Statements
Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (English)
0 references
12 February 2010
0 references
0-1 quadratic knapsack problem
0 references
linearization
0 references
