Skip to main content
SpringerLink
Log in

The general problem solving algorithm and its implementation

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bland, R. G., Goldfarb, D. and Todd, H. J., “The Ellipsoid Method: A Survey,”Operations Research, 29, 1981.

  2. 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.

    Google Scholar 

  3. 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.

  4. Dantzig, G. B.,Linear Programming and Extensions, Princeton Univ. Press, 1963.

  5. 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.

    Google Scholar 

  6. Horowitz, E. and Sahni, S.,Fundamentals of Computer Algorithms, Computer Science Press, Rockville, Maryland, 1978.

    MATH  Google Scholar 

  7. Lai, T-H. and Sahni, S., “Anomalies in Parallel Branch-and-Bound Algorithms,”CACM, 27:6, 1984.

    MathSciNet  Google Scholar 

  8. McKeown, G. P. and Rayward-Smith, V. J., “Communication Problems on MIMD Parallel Computers,”Information Processing Letters, 19:2, 1984.

    Article  Google Scholar 

  9. Nilsson, N. J.,Problem Solving Methods in Artificial Intelligence, McGraw Hill, New York, 1971.

    Google Scholar 

  10. Seitz, C. L., “The Cosmic Cube,”Comm. ACM,Vol. 28,No. 1, 1985.

  11. Topor, R. W., “Termination Detection for Distributed Computations,”Information Processing Letters, 18, 1, 1984.

    Article  MathSciNet  Google Scholar 

  12. Wah, B. W., Li, G. and Yu, C. F., “Multiprocessing of Combinatorial Search Problems,”IEEE Computer, 1985.

Download references

Author information

Authors and Affiliations

  1. University of East Anglia, Norwich, England

    V. J. Rayward-Smith & G. P. McKeown

  2. University of Colorado, Denver, U. S. A.

    F. W. Burton

Authors
  1. V. J. Rayward-Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. P. McKeown
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. W. Burton
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037504

Keywords

Search

Navigation