1. Amini, M. and Racer, M. (1994) “A rigorous computational comparison of alternative solution methods for the generalized assignment problem”, Management Science, vol. 40, pp. 868–890.
2. Appleget, J.A. (1997) “Knapsack cuts and explicit-constraint branching for solving integer programs”, Ph.D. dissertation, Naval Postgraduate School, Monterey, CA, June 1997.
3. Balas, E. (1975) “Facets of the knapsack polytope”, Mathematical Programming, vol. 8, pp. 146–164.
4. Balas, E. and Zemel, E. (1978) “Facets of the knapsack polytope from minimal covers”, SIAM Journal of Applied Mathematics, vol. 34, pp. 119–148.
5. Beale, E.M.L. and Tomlin, J.A. (1970) “Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables”, in Proceedings of the 5th International Operations Research Conference, J. R. Lawrence (ed.), Tavistock Publications Limited, London, pp. 447–454.