论文信息 - REDUCTION OF INTEGER POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING PROBLEMS

REDUCTION OF INTEGER POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING PROBLEMS

1. E. BALAS, "An Additive Algorithm for Solving Linear Programs with Zero-One Variables," Opns. Res. 13, 517-546 (1965). 2. F. GLOVER AND S. ZIONTS, "A Note on the Additive Algorithm of Balas," Opns. Res. 13, 546-549 (1965). 3. R. J. FREEMAN, "Computational Experience with a 'Balasian' Integer Programming Algorithm," Opns. Res. 14, 935-941 (1966). 4. W. D. JAMES, "Some Remarks on a Numerial Example of Balas and on the Note by Glover and Zionts," Opns. Res. 14, 941-942 (1966). 5. B. FLEISCHMANN, "Computational Experience with the Algorithm of Balas," Opns. Res. 15, 153-155 (1967).

Lawrence J. Watters | Karl M. Brauer

[1] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[2] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[3] Fred Glover,et al. A Note on the Additive Algorithm of Balas , 1965 .

[4] S. Reiter,et al. Discrete Optimizing Solution Procedures for Linear and Nonlinear Integer Programming Problems , 1966 .

[5] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[6] Clifford C. Petersen,et al. Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .