1. E. Balas and E. Zemel, “Solving large 0–1 knapsack problems”, Management Sciences Report 408, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976), revised July 1977).
2. R. Barr and G.T. Ross, “A linked list data structure for a binary knapsack algorithm”, Research Report CCS 232, Center for Cybernetic Studies, The University of Texas at Austin (1975).
3. E. Beale and J. Tomlin, “Special facilities in a general mathematical programming system for non-convex problems using special ordered sets of variables”, in:Proceedings of the 5th IFORS conference (London, 1970) 447–454.
4. E. Beale and J. Tomlin, “An integer programming approach to a class of combinatorial problems”,Mathematical Programming 3 (3) (1972) 339–344.
5. D. Fayard and G. Plateau, “Resolution of the 0–1 knapsack problem: comparison of methods”,Mathematical Programming 8 (3) (1975) 272–307.