haku: @indexterm Dynamic programming / yhteensä: 309
viite: 36 / 309
| Tekijä: | Pisinger, D. |
| Otsikko: | An exact algorithm for large multiple knapsack problems |
| Lehti: | European Journal of Operational Research
1999 : MAY 1, VOL. 114:3, p. 528-541 |
| Asiasana: | OPERATIONAL RESEARCH INTEGER PROGRAMMING DYNAMIC PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | the multiple knapsack problem (MKP) is the problem of assigning a subset of n items to m distinct knapsacks, such that the total profit sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several applications in naval as well as financial management. A new exact algorithm for the MKP is presented, which is specially designed for solving large problem instances. |
SCIMA