A Comparison of Three Algorithms for Linear Zero-One Programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Comparison of Three Algorithms for Linear Zero-One Programs

Full text

Pdf (159 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 , Issue 4 (December 1976) table of contents

Pages: 331 - 334

Year of Publication: 1976

ISSN:0098-3500

Authors

A. Mahendrarajah	Department of Mathematics, Carleton University, Ottawa, Ont., Canada
F. Fiala	Department of Mathematics, Carleton University, Ottawa, Ont., Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 23, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355705.355708 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BALINSKI, M.L., AND SPIELBERG, K. Methods for integer programming: algebraic, combinational, and enumerative. In Progress in Operations Res., Vol III, J.S. Aronofsky, Ed. Wiley, New York, 1969, pp. 195-292.
	2	J. L. Byrne , L. G. Proll, Algorithms: Algorithm 341: solution of linear programs in 0-1 variables by implicit enumeration, Communications of the ACM, v.11 n.11, p.782, Nov. 68 [doi>10.1145/364139.364171]
	3	BYRNE, J.L., AND PROLL, L.G. Initialising Geoffrion's implicit enumeration algorithm for the zero-one hnear programming problem. Computer J. 12, 4 (Nov. 1969), 381-384.
	4	František Fiala, Algorithm 449: solution of linear programming problems in 0-1 variables, Communications of the ACM, v.16 n.7, p.445-447, July 1973 [doi>10.1145/362280.362304]
	5	FIALA, F. An optimal and near optimal solution to linear 0-1 programming problems. No. 86, Carleton Math. Series, May 1973.
	6	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 [doi>10.1145/800184.810517]
	7	GEOFFRION, A M. Integer programming by irq, pliclt enumeration and Balas' method. SIAM Rev. 9, 2 (April 1967), 178-190.
	8	GLOVER, F. A multiphase-dual algorithm for the zero-one integer programming problem. Operatwns Res. 18, 6 (Nov./Dec. 1965), 879-919.
	9	Ronald L. Gue , Kenneth C. Cain , John C. Liggett, Analysis of algorithms for the zero-one programming problem, Communications of the ACM, v.11 n.12, p.837-844, Dec. 1968 [doi>10.1145/364175.364209]
	10	HALDI, J. 25 integer programming test problems. Working Paper No. 43, Grad. School of Business, Stanford U., Stanford, Calif., Dee. 1964.
	11	HAMMER, P.L., AND RUDEANU, S. Boolean Methods in Operations Research and Related Areas. Springer, New York, 1968.
	12	LAWLER, E.L., AND BELL, M.D. A method for solving discrete optimization problems. Operations Res. 14, 6 (Nov./Dec. 1966), 1098-1112.
	13	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 [doi>10.1145/362452.362491]
	14	TRAUTH, JR., C.A., AND WOOLSEY, R.E. Practical aspects of integer linear programming. Monog. SC-R-66-925, Sandia Corp., Aug. 1966.