haku: @journal_id 112 / yhteensä: 1577
viite: 119 / 1577
| Tekijä: | Yu, G. |
| Otsikko: | On the max-min 0-1 knapsack problem with robust optimization applications |
| Lehti: | Operations Research
1996 : MAR-APR, VOL. 44:2, p. 407-415 |
| Asiasana: | MANAGEMENT |
| Kieli: | eng |
| Tiivistelmä: | Given a set of items, a set of scenarios , and a knapsack of fixed capacity, a nonnegative weight is associated with each item; and a value is associated with each item under each scenario. The max-min Knapsack (MNK) problem is defined as filling the knapsack with a selected set of items so that the minimum total value gained under all scenarios is maximised. The MNK problem is a generalization of the conventional knapsack problem to situations with multiple scenarios. This extention significantly enlarges its scope of applications. |
SCIMA