Skip Navigation

The Computer Journal 1969 12(4):381-384; doi:10.1093/comjnl/12.4.381
© 1969 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Byrne, J. L.
Right arrow Articles by Proll, L. G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Initialising Geoffrion's implicit enumeration algorithm for the zero-one linear programming problem

J. L. Byrne1 * and L. G. Proll2 §

1 Department of Mathematics, University of Queensland, Australia, 2 Department of Mathematics, University of Southampton, Southampton, UK

This paper describes a method of initialising Geoffrion's algorithm for the solution of linear programs in zero-one variables. The modification proposed involves three modules, one or all of which may be employed in a particular computation. A computational comparison is made between the original and modified algorithms.

Received December 1968. revised April 1969.

* Department of Mathematics, University of Queensland

§ Department of Mathematics, University of Southampton


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.