Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118)
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: Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem |
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
0 references
0 references
0 references
0 references
0 references
