Atécio Alves, V. Amaral, Jônatas O. L. Silva, P. S. M. Santos, S. S. Souza
2026.1.2OPTIMIZATION METHODS & SOFTWARE
tlooto Summary
A gradient-type method for solving a quadratic separable knapsack problem, which is simpler than the existing methods and competitive in practice and to demonstrate its efficiency, illustrated computational results are reported.
Abstract
In this paper, we propose a gradient-type method for solving a quadratic separable knapsack problem, which is simpler than the existing methods and competitive in practice. The algorithm uses a smooth approximation of the dual function of the knapsack problem. Partial convergence and complexity results of the algorithm are presented. Moreover, to demonstrate its efficiency, illustrative computational results are reported.
Citation format
ALVES, Atécio, et al. A smoothing method for solving quadratic convex separable knapsack problems. OPTIMIZATION METHODS & SOFTWARE, 2026, 41(1): 173–191.