A note on the max-min 0-1 knapsack problem (Q1304387): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:16, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the max-min 0-1 knapsack problem |
scientific article |
Statements
A note on the max-min 0-1 knapsack problem (English)
0 references
17 February 2000
0 references
surrogate relaxation
0 references
linear programming relaxation
0 references
branch-and-bound
0 references
max-min 0-1 knapsack problem
0 references
