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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of control science and engineering Jg. 2024; S. 1 - 17
Hauptverfasser:	Alves, Atécio, Silva, Jônatas O. L., Matioli, Luiz C., Santos, Paulo S. M., Souza, Sissy S.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Hindawi 08.02.2024 John Wiley & Sons, Inc Wiley
Schlagworte:	Algorithms Computing time Knapsack problem Lagrange multiplier Methods Optimization
ISSN:	1687-5249, 1687-5257
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!