Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q60395659, #quickstatements; #temporary_batch_1710979808849 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60395659 / rank | |||
Normal rank | |||
Revision as of 02:18, 21 March 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
