.png){kind=icon}
.png){kind=icon}
Return
A smoothing method for solving quadratic convex separable knapsack problems
.png){kind=icon}
PRE
AI
DOI：10.1080/10556788.2025.2611436.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Separable Knapsack problem
root-finding algorithm
quadratic problem
smooth approximations
Journal
O
IF:
1.4
Papers:
31
Citations:
0