Efficient Methods For Solving Quadratic 0–1 Knapsack Problems (Q4372880): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.1080/03155986.1997.11732327 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2401096565 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:47, 19 March 2024
scientific article; zbMATH DE number 1097710
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Methods For Solving Quadratic 0–1 Knapsack Problems |
scientific article; zbMATH DE number 1097710 |
Statements
Efficient Methods For Solving Quadratic 0–1 Knapsack Problems (English)
0 references
8 June 1998
0 references
\(L_ 2\)-best linear approximation
0 references
heuristic
0 references
branch and bound
0 references
linear inequality
0 references
