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...
Saved in:
| Main Authors: | Atécio Alves, Jônatas O. L. Silva, Luiz C. Matioli, Paulo S. M. Santos, Sissy S. Souza |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Journal of Control Science and Engineering |
| Online Access: | http://dx.doi.org/10.1155/2024/7602027 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Machine Learning-Driven Optimization for Solution Space Reduction in the Quadratic Multiple Knapsack Problem
by: Diego Yanez-Oyarce, et al.
Published: (2025-01-01) -
Fixed points of multivalued convex contractions with application.
by: Abdul Rahim Khan, et al.
Published: (2025-01-01) -
Beyond classical convexity: super-quadratic convex mappings and their inequality framework
by: Muhammad Zakria Javed, et al.
Published: (2025-06-01) -
The Stability of a Quadratic Functional Equation with the Fixed Point Alternative
by: Choonkil Park, et al.
Published: (2009-01-01) -
Fixed Point Theory in b-convex Metric Spaces
by: LI Chao-bo, et al.
Published: (2021-04-01)