An Accelerated Fixed-Point Algorithm Applied to Quadratic Convex Separable Knapsack Problems

In this article, we propose a root-finding algorithm for solving a quadratic convex separable knapsack problem, which is more straightforward than existing methods and competitive in practice. Besides, we also present an extension of the proposal, which improves its computational time, and then we i...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of control science and engineering Ročník 2024; s. 1 - 17
Hlavní autori:	Alves, Atécio, Silva, Jônatas O. L., Matioli, Luiz C., Santos, Paulo S. M., Souza, Sissy S.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Hindawi 08.02.2024 John Wiley & Sons, Inc Wiley
Predmet:	Algorithms Computing time Knapsack problem Lagrange multiplier Methods Optimization
ISSN:	1687-5249, 1687-5257
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!