The quadratic knapsack problem
这篇综述全面回顾了二次背包问题的经典与最新成果，涵盖数学模型、线性化方法、上界、精确算法及启发式方法，并比较了计算性能，适合研究组合优化和运筹学的学者快速了解该领域进展。
The quadratic knapsack problem is a relevant N P -hard combinatorial optimization problem, inspired, since the Seventies, by a number of real-world applications. After its formal definition in 1980, it was subject to intensive research, especially in the last two decades. No recent review on this problem appeared in the literature after a well-known survey, published in 2007 but updated to 2003. The purpose of this work is to provide a thorough overview of classical and recent results on the quadratic knapsack problem. We examine mathematical models, linearizations and reformulations. We review upper bounds, exact algorithms, heuristic and metaheuristic approaches, and provide a comparison of their computational performance.