Breakpoint searching algorithms for the continuous quadratic knapsack problem
 R. Cottle,et al. A Lagrangean relaxation algorithm for the constrained matrix problem , 1986 .
 Krzysztof C. Kiwiel. On Floyd and Rivest's SELECT algorithm , 2005, Theor. Comput. Sci..
 Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
 K. Kiwiel. Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem , 2008 .
 P. Pardalos. Complexity in numerical optimization , 1993 .
 Jose A. Ventura. Computational development of a lagrangian dual approach for quadratic networks , 1991, Networks.
 Dorit S. Hochbaum,et al. About strongly polynomial time algorithms for quadratic optimization over submodular constraints , 1995, Math. Program..
 P. Brucker. Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .
 Stavros A. Zenios,et al. Massively Parallel Algorithms for Singly Constrained Convex Programs , 1992, INFORMS J. Comput..
 Hanan Luss,et al. Technical Note - Allocation of Effort Resources among Competing Activities , 1975, Oper. Res..
 C. Michelot. A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .
 A. G. Robinson,et al. On the continuous quadratic knapsack problem , 1992, Math. Program..
 Bala Shetty,et al. A Parallel Projection for the Multicommodity Network Model , 1990 .
 Panos M. Pardalos,et al. An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds , 1990, Math. Program..
 Arnoldo C. Hax,et al. Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables , 1981 .
 Siddhartha S. Syam,et al. A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems , 1995, INFORMS J. Comput..
 Dorit S. Hochbaum,et al. Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources , 1994, Math. Oper. Res..
 Siddhartha S. Syam,et al. A Projection Method for the Integer Quadratic Knapsack Problem , 1996 .
 Geraldo Galdino de Paula,et al. A linear-time median-finding algorithm for projecting a vector on the simplex of Rn , 1989 .
 Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
 P. Berman,et al. Algorithms for the Least Distance Problem , 1993 .
 Michel Minoux,et al. A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$ , 1997 .
 Bala Shetty,et al. Quadratic resource allocation with generalized upper bounds , 1997, Oper. Res. Lett..
 J. J. Moré,et al. Quasi-Newton updates with bounds , 1987 .
 Jeffery L. Kennington,et al. A polynomially bounded algorithm for a singly constrained quadratic program , 1980, Math. Program..
 P. Zipkin. Simple Ranking Methods for Allocation of One Resource , 1980 .
 Nimrod Megiddo,et al. Linear time algorithms for some separable quadratic programming problems , 1993, Operations Research Letters.