ACM

Communications of the ACM

Home/Magazine Archive/January 1971 (Vol. 14, No. 1)/Further evidence for the analysis of algorithms for.../Abstract

Further evidence for the analysis of algorithms for the zero-one programming problem

By L. G. Proll
Communications of the ACM, January 1971, Vol. 14 No. 1, Pages 46-47
10.1145/362452.362491
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

The purpose of this note is to report computational experience additional to that recently summarized by Gue et al., with two algorithms for the zero-one linear programming problem. An error in Gue's paper is corrected. The utility of one of the algorithms as a suboptimizer is indicated.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.