The general problem solving algorithm and its implementation

DOI10.1007/BF03037504zbMath0646.68108OpenAlexW1993648964MaRDI QIDQ1104126

G. P. McKeown, V. J. Rayward-Smith, F. Warren Burton

Publication date: 1988

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037504

zbMATH Keywords

integer programmingdynamic programmingbranch-and-boundparallelismdivide-and-conqueralgorithm designalgorithm abstractioncombinatorial computinggeneral problem solving algorithmtree and graph searching

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Discrete mathematics in relation to computer science (68R99)

Related Items (5)

An introduction to parallelism in combinatorial optimization ⋮ UET scheduling with unit interprocessor communication delays ⋮ Performances of parallel branch and bound algorithms with best-first search ⋮ The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks ⋮ Branch-and-bound as a higher-order function

Cites Work

• Anomalies in parallel branch-and-bound algorithms
• Feature Article—The Ellipsoid Method: A Survey
• Unnamed Item
• Unnamed Item

This page was built for publication: The general problem solving algorithm and its implementation