ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Algorithms: Algorithm 341: solution of linear programs in 0-1 variables by implicit enumeration
Full text PdfPdf (942 KB)
Source
Communications of the ACM archive
Volume 11 ,  Issue 11  (November 1968) table of contents
Page: 782  
Year of Publication: 1968
ISSN:0001-0782
Authors
J. L. Byrne  Univ. of Southampton, Hampshire, England
L. G. Proll  Univ. of Southampton, Hampshire, England
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Citation Count: 2
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/364139.364171
What is a DOI?

CITED BY  2
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

INDEX TERMS

Keywords:
linear programming, partial enumeration, zero-one variables

Collaborative Colleagues:
J. L. Byrne: colleagues
L. G. Proll: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player