An Accelerated Fixed-Point Algorithm Applied to Quadratic Convex Separable Knapsack Problems.
Atécio AlvesJônatas O. L. SilvaLuiz Carlos MatioliPaulo Sérgio Marques dos SantosSissy S. SouzaPublished in: J. Control. Sci. Eng. (2024)
Keyphrases
- knapsack problem
- fixed point
- optimal solution
- computational complexity
- dynamic programming
- objective function
- learning algorithm
- np hard
- probabilistic model
- special case
- search space
- simulated annealing
- matching algorithm
- test problems
- cost function
- machine learning
- optimization problems
- query language
- worst case
- linear programming
- image matching
- stationary points
- implicit enumeration