1. An additive algorithm for solving linear programs with zero-one variables;Balas;Operations Res.,1965
2. Bivalent programming by implicit enumeration;Balas,1975
3. E. Balas, Disjunctive programming, Ann. Discrete Math. 5, this volume
4. E. Balas and Zemel, Solving large zero-one knapsack problems, M.S.S.R. No. 408, Carnegie-Mellon University, June 1976, to appear in Operations Res
5. E.M.L. Beale, Branch and bound methods for mathematical programming systems, present volume, p