Skip Navigation

The Computer Journal 1974 17(1):69-74; doi:10.1093/comjnl/17.1.69
© 1974 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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Page, E. S.
Right arrow Articles by Waller, L.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An interactive approach for the solution of a class of discrete optimisation problems

E. S. Page * and L. Waller *

Computing Laboratory, University of Newcastle-upon-Tyne, Claremont Tower, Claremont Road, Newcastle-upon-Tyne, UK

The paper describes the design and implementation of an interactive system for attacking a wide class of discrete optimisation problems. Features requiring consideration in such a system are the interface with the human, the requirements from the operating system, and the variety of heuristics techniques that must be provided. Some details are given of interactive facilities for limiting the amount of computation expended in a backtracking approach for a ‘branch-and-bound’ search.


Received August 1972.

* Computing Laboratory, University of Newcastle-upon-Tyne, Claremont Tower, Claremont Road, Newcastle-upon-Tyne NE1 7RU


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.