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.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Bland, R. G., Goldfarb, D. and Todd, H. J., “The Ellipsoid Method: A Survey,”Operations Research, 29, 1981.
Burton, F. W., Huntbach, M. M., McKeown, G. R. and Rayward-Smith, V. J., “Parallelism in Branch-and-Bound Algorithms,”MAG Research Report, School of Computing Studies and Accountancy, University of East Anglia, Norwich, England, 1983.
Burton, F. W., McKeown, G. P., Rayward-Smith, V. J. and Sleep, M. R., “Parallel Processing and Combinatorial Optimization,”Proceedings of the CO81 Conference, Stirling University, Stirling, Scotland, 1982.
Dantzig, G. B.,Linear Programming and Extensions, Princeton Univ. Press, 1963.
Finkel, R. and Manber, U., “DIB—a Distributed Implementation of Backtracking,”Proceedings of the 5th IEEE International Conference on Distributed Computing Systems, IEEE Computer Society Press, Silver Spring, MD., 1985.
Horowitz, E. and Sahni, S.,Fundamentals of Computer Algorithms, Computer Science Press, Rockville, Maryland, 1978.
Lai, T-H. and Sahni, S., “Anomalies in Parallel Branch-and-Bound Algorithms,”CACM, 27:6, 1984.
McKeown, G. P. and Rayward-Smith, V. J., “Communication Problems on MIMD Parallel Computers,”Information Processing Letters, 19:2, 1984.
Nilsson, N. J.,Problem Solving Methods in Artificial Intelligence, McGraw Hill, New York, 1971.
Seitz, C. L., “The Cosmic Cube,”Comm. ACM,Vol. 28,No. 1, 1985.
Topor, R. W., “Termination Detection for Distributed Computations,”Information Processing Letters, 18, 1, 1984.
Wah, B. W., Li, G. and Yu, C. F., “Multiprocessing of Combinatorial Search Problems,”IEEE Computer, 1985.
About this article
Cite this article
Rayward-Smith, V.J., McKeown, G.P. & Burton, F.W. The general problem solving algorithm and its implementation. New Gener Comput 6, 41–66 (1988). https://doi.org/10.1007/BF03037504
- Algorithm Design
- Algorithm Abstraction
- Combinatorial Computing