haku: @indexterm Knapsack problem / yhteensä: 30
viite: 19 / 30
| Tekijä: | Lee, J. S. Guidnard, M. |
| Otsikko: | An approximate algorithm for multidimensional zero-one knapsack problems : a parametric approach. |
| Lehti: | Management Science
1988 : MAR, VOL. 34:3, p. 402-410 |
| Asiasana: | KNAPSACK PROBLEM INTEGER PROGRAMMING HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | A new approximate algorithm for multidimensional zero-one knapsack problems with all positive coefficient is presented. The procedure is controlled by three parameters which affect the tradeoff between solution quality and computation time and whose values are set by the users. That is the procedure can be flexibly tailored to users' need and computer speed. It can also be incorporated in any 0-1 programming algorithm such as a branch and bound or an implicit enumeration algorithm, which need fast and good lower bounds. |
SCIMA