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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have