Dynamic-Threshold Algorithms for the Continuous Quadratic Knapsack Problem: Reset Mechanisms and Complexity
A dynamic-threshold algorithm (DTA) is developed for a continuous quadratic knapsack problem with a weighted equality constraint that maintains a threshold invariant through three operations--addition, reset, and removal--and its finite termination and correctness are established.