• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.611-628
• /
• 2021

In this paper, we propose a new branch-reduction-and-bound algorithm to solve the nonlinear knapsack problems by using general discrete monotonic optimization techniques. The specific properties of the problem are exploited to increase the efficiency of the algorithm. Computational experiments of the algorithm on problems with up to 30 variables and 5 different constraints are reported.