Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction (Q2892339): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q58826434, #quickstatements; #temporary_batch_1712190744730 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/ijoc.1050.0172 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971967801 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58826434 / rank | |||
Normal rank | |||
Latest revision as of 03:31, 4 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction |
scientific article |
Statements
Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction (English)
0 references
18 June 2012
0 references
quadratic programming
0 references
branch and bound
0 references
computational complexity
0 references
relaxation
0 references
