1. Quadratic knapsack problems;Gallo,1980
2. Algorithm for a least-distance programming problem;Wolfe,1974
3. Maxima for graphs and a new proof of a theorem of Turán;Motzkin;Canadian Journal of Mathematics,1965
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Gary,1979
5. Checking local optimality in constrained quadratic programming is NP-hard;Pardalos;Operations Research Letters,1988