On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications (Q4888190): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 18:54, 5 March 2024
scientific article; zbMATH DE number 909760
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications |
scientific article; zbMATH DE number 909760 |
Statements
On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications (English)
0 references
28 October 1996
0 references
max-min 0-1 knapsack problem
0 references
multiple scenarios
0 references
approximation algorithm
0 references
branch-and-bound
0 references
