Skip Navigation

The Computer Journal 1971 14(4):418-421; doi:10.1093/comjnl/14.4.418
© 1971 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 (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Christofides, N.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Zero-one programming using non-binary tree-search

N. Christofides *

Department of Management Science, Imperial College, Exhibition Road, London, UK

The paper gives a method for minimising a linear function of zero-one variables subject to constraints. The method is based on a non-binary tree search, whose primary objective is to achieve feasibility. The search is limited by calculating bounds at each stage using concepts from the theory of graphs. The algorithm promises to be computationally efficient and a 12-variable problem is solved as an example to illustrate its effectiveness.

Received February 1970. Revised January 1971.

* Department of Management Science, Imperial College, Exhibition Road, London SW7


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.