A note on a general non-linear knapsack problem |
| |
| Affiliation: | 1. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong;2. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China |
| |
| Abstract: | This paper discusses a general non-linear knapsack problem with a concave objective function and a single conves constraint. in particular, it includes an efficient procedure to find the continuous (relaxed) solution and a reduction process which computes tight lower and upper bounds on the integer variables. Some implicit enumeration criteria to be used in an enumeration algorithm are also suggested. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
