The paper presents an O(n2) method for solving the cardinality constrained linear programming knapsack problem. The method improves the O(n3) algorithm of Campello and Maculan. An O(n2logn) method for the continuous relaxation of the 0-1 collapsing knapsack problem is discussed. Computational experiments are reported.
