1. Balas, E. and Zemel, E. "Solving large zero-one knapsack problems", Management Sciences Research Report No. 408 R Carnegie-Mellon University /1977/
2. Fayard, D. and Plateau, G. "Techniques de resolution du Probleme du Knapsack en variables bivalents". Bulletin de la Direction des Etudes et Recherches E.D.F. Serie C, No.1. /1976/
3. Fayard, D.and Plateau, G. "Techniques de resoltuion du probleme du knapsack en variables bivalentes: partie 3" Publications no 91 du Laboratoire de Calcul de l'Université des Sciences et Techniques de Lille /1977/
4. Geoffrion, A.M. "Lagrangean Relaxation for Integer Programming", Mathematical Programming Study 2 /1974/ 82–114.
5. Greenberg, H.and Hegerich, R.L. "A branch search algorithm for the knapsack problem", Management Science 16/5/ /1970/ 327–332.