haku: @indexterm KNAPSACK PROBLEM / yhteensä: 30
viite: 10 / 30
| Tekijä: | Domingo, A. Sniedovich, M. |
| Otsikko: | Experiments with dynamic programming algorithms for nonseparable problems |
| Lehti: | European Journal of Operational Research
1993 : JUN 11 , VOL. 67:2, p. 172-187 |
| Asiasana: | DYNAMIC PROGRAMMING KNAPSACK PROBLEM OPERATIONAL RESEARCH |
| Kieli: | eng |
| Tiivistelmä: | In this paper the authors report on numerical experiments with dynamic programming algorithms designed for solving problems with nonseparable objective functions of the C-programming type. The experiments were conducted with the view to evaluate the efficiency of C-programming's exclusionary rules when they are incorporated in the conventional parametric Lagrangian search method. Two classical nonseparable problems are considered: (1) the variance minimization problem and (2) the nonlinear fractional knapsack problem. |
SCIMA