The general problem solving algorithm and its implementation
From MaRDI portal
Publication:1104126
DOI10.1007/BF03037504zbMath0646.68108MaRDI QIDQ1104126
G. P. McKeown, V. J. Rayward-Smith, F. Warren Burton
Publication date: 1988
Published in: New Generation Computing (Search for Journal in Brave)
integer programming; dynamic programming; branch-and-bound; parallelism; divide-and-conquer; algorithm design; algorithm abstraction; combinatorial computing; general problem solving algorithm; tree and graph searching
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68R99: Discrete mathematics in relation to computer science
Related Items
An introduction to parallelism in combinatorial optimization, UET scheduling with unit interprocessor communication delays, The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks, Branch-and-bound as a higher-order function, Performances of parallel branch and bound algorithms with best-first search
Cites Work