On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications (Q4888190): 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.1287/opre.44.2.407 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076163541 / rank | |||
Normal rank | |||
Latest revision as of 19:07, 19 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
