Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Alves et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: