Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.20364 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989287418 / rank | |||
Normal rank | |||
Revision as of 19:58, 19 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
