The general problem-solving algorithm and its implementation

Research output: Contribution to journalArticle

5 Citations (Scopus)


By generalising problem solving techniques such as divide-and-conquer, dynamic programming, tree and graph searching, integer programming and branch-and-bound, a general problem solving algorithm is deduced. Various examples of the use of this algorithm are given and its implementation on both sequential and parallel machines, such as the cosmic cube, is discussed.
Original languageEnglish
Pages (from-to)41-66
Number of pages26
JournalNew Generation Computing
Issue number1
Publication statusPublished - Jun 1988

Cite this