1

GLASS, HARVEY. A Zero-One Algorithm. Honeywell Aeronaut. Div., St. Petersburg, Fla., Dec., 1965. (Monog.)

2

BALAS, EGON. An additive algorithm for solving the linear programs with zero-one variables. Oper. Res. 13, 4 (July- Aug. 1965), 517-546.

3

GLOVER, FRED. A multiphase-dual algorithm for the zero-one integer programming problem. Oper. Res. 13, 6 (Nov.-Dec. 1965), 879-919.

4

LAWLER, E. L., AND BELL, M. D. A method for solving discrete optimization problems. Oper. Res. 14, 6 (Nov.-Dec. 1966), 1098-1112.

5

LEMKE, C. E., AND SFIELBERG, K. Direct Search Zero-One and Mixed Integer Programming. IBM Scientific Center, New York, June 1966. (Monog.)

6

HEALY, W. C., JR. Multiple choice programming. Oper. Res., 12. 1 (Jam-Feb. 1964), 122-138.

7

Joseph L. Balintfy, Menu planning by computer, Communications of the ACM, v.7 n.4, p.255-259, April 1964  [doi>10.1145/364005.364087]

8

SCHRAGE, L., AND WOILER, S. A general structure for implicit enumeration. Paper, 14th Int. Meeting, Inst. of Management Sci., Mexico City, Aug. 1967.

9

LIGGETT, JOHN C. A General multiple choice formulation of an algorithm by Balintfy. Teeh. Rep. No. CP-68004, Comput. Sci. Center, Southern Methodist U., Dallas, Texas, Mar. 1968.

10

GLOVER, F., AND ZIONTS, S. A note on the additive algorithm of Balas. Oper. Res. 18, 4 (July-Aug. 1965), 546-549.

11

FLEISCHMAN, BERNHARD. Computational experience with the algorithm of Balas. Oper. Res. 15, 1 (Jam-Feb. 1967), 153-155.

12

GEOFFRION, ARTHUR M. Integer programming by implicit enumeration and Balas' method. Memo. RM-4783-PR, Rand Corp., Santa Monica, CMif. Feb. 1966.

13

HADLEY, G. Linear Programming. Addison-Wesley, Reading, Mass., 1962.

14

PETERSEN, CLIFFORD C. Computational experience with variants of the Balas algorithm applied to the selection of R and D projects. Mgmt. Sci. 18, 9 (May 1967), 735-750.

15

FREEMAN, RAOUL J. Computational experience with a 'Balasian' integer programming algorithm. Opcr. Res. 14, 5 (Sept.-Oct. 1966), 935-941.

16

GUE, RONALD L. A decomposition principle for the zero-one programming problem. Paper, 14th Int. Meeting, Inst. of Management Sci., Mexico City, Aug. 1967.

17

BALAS, EGON Discrete programming by the filter method. Oper. Res. 15, 5 (Sept.-Oct. 1967), 915-957.

18

LEMKE, C. E. AND SPIELBERG, K. Direct search algorithms for zero-one and mixed-integer programming. Oper. Res. 15, 5 (Sept.-Oct. 1967), 892-914.

19

RAO, ASHOK. Balas' and Glover's algorithm: a comparison. Paper, 23rd Nat. Meeting, Operations Research Soc. of Amer., Chicago, Nov. 1967.

20

GEOFFRION, A. M. An improved implicit enumeration approach for integer programming. Memo. RM-5644-PR, Rand Corp., Santa Monica, Calif., June 1968.

21

EVERETT, HUGH, III. Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Oper. Res. 11, 3 (May-June 1963), 399-417.

22

NEMHAUSER, GEORGE L., AND ULLMAN, ZEV. A note on the generalized Lagrange Multiplier solution to an integer programming problem. Oper. Res. 16, 2 (Mar.-Apr. 1968), 450-452.

23

HAMMER, P. L., AND RUDEANU, S. Boolean Methods in Operations Research. Springer-Verlag, New York, 1968.

Frantisek Fiala, Computational experience with a modification of an algorithm by Hammer and Rudeanu for 0-1 linear programming, Proceedings of the 1971 26th annual conference, p.482-488, January 1971

A. Mahendrarajah , F. Fiala, A Comparison of Three Algorithms for Linear Zero-One Programs, ACM Transactions on Mathematical Software (TOMS), v.2 n.4, p.331-334, Dec. 1976

L. G. Proll, Further evidence for the analysis of algorithms for the zero-one programming problem, Communications of the ACM, v.14 n.1, p.46-47, Jan. 1971

Ronald L. Gue: colleagues

Kenneth C. Cain: colleagues

John C. Liggett: colleagues