{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:04:26Z","timestamp":1648940666625},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1007\/bf03037504","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T03:16:58Z","timestamp":1240543018000},"page":"41-66","source":"Crossref","is-referenced-by-count":3,"title":["The general problem solving algorithm and its implementation"],"prefix":"10.1007","volume":"6","author":[{"given":"V. J.","family":"Rayward-Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. P.","family":"McKeown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. W.","family":"Burton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037504_CR1","doi-asserted-by":"crossref","unstructured":"Bland, R. G., Goldfarb, D. and Todd, H. J., \u201cThe Ellipsoid Method: A Survey,\u201dOperations Research, 29, 1981.","DOI":"10.1287\/opre.29.6.1039"},{"key":"BF03037504_CR2","series-title":"MAG Research Report","volume-title":"Parallelism in Branch-and-Bound Algorithms","author":"F. W. Burton","year":"1983","unstructured":"Burton, F. W., Huntbach, M. M., McKeown, G. R. and Rayward-Smith, V. J., \u201cParallelism in Branch-and-Bound Algorithms,\u201dMAG Research Report, School of Computing Studies and Accountancy, University of East Anglia, Norwich, England, 1983."},{"key":"BF03037504_CR3","unstructured":"Burton, F. W., McKeown, G. P., Rayward-Smith, V. J. and Sleep, M. R., \u201cParallel Processing and Combinatorial Optimization,\u201dProceedings of the CO81 Conference, Stirling University, Stirling, Scotland, 1982."},{"key":"BF03037504_CR4","doi-asserted-by":"crossref","unstructured":"Dantzig, G. B.,Linear Programming and Extensions, Princeton Univ. Press, 1963.","DOI":"10.7249\/R366"},{"key":"BF03037504_CR5","series-title":"Proceedings of the 5th IEEE International Conference on Distributed Computing Systems","volume-title":"DIB\u2014a Distributed Implementation of Backtracking","author":"R. Finkel","year":"1985","unstructured":"Finkel, R. and Manber, U., \u201cDIB\u2014a Distributed Implementation of Backtracking,\u201dProceedings of the 5th IEEE International Conference on Distributed Computing Systems, IEEE Computer Society Press, Silver Spring, MD., 1985."},{"key":"BF03037504_CR6","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1978","unstructured":"Horowitz, E. and Sahni, S.,Fundamentals of Computer Algorithms, Computer Science Press, Rockville, Maryland, 1978."},{"key":"BF03037504_CR7","first-page":"6","volume":"27","author":"T-H. Lai","year":"1984","unstructured":"Lai, T-H. and Sahni, S., \u201cAnomalies in Parallel Branch-and-Bound Algorithms,\u201dCACM, 27:6, 1984.","journal-title":"CACM"},{"key":"BF03037504_CR8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0020-0190(84)90100-5","volume":"19","author":"G. P. McKeown","year":"1984","unstructured":"McKeown, G. P. and Rayward-Smith, V. J., \u201cCommunication Problems on MIMD Parallel Computers,\u201dInformation Processing Letters, 19:2, 1984.","journal-title":"Information Processing Letters"},{"key":"BF03037504_CR9","volume-title":"Problem Solving Methods in Artificial Intelligence","author":"N. J. Nilsson","year":"1971","unstructured":"Nilsson, N. J.,Problem Solving Methods in Artificial Intelligence, McGraw Hill, New York, 1971."},{"key":"BF03037504_CR10","doi-asserted-by":"crossref","unstructured":"Seitz, C. L., \u201cThe Cosmic Cube,\u201dComm. ACM,Vol. 28,No. 1, 1985.","DOI":"10.1145\/2465.2467"},{"key":"BF03037504_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(84)90071-1","volume":"18","author":"R. W. Topor","year":"1984","unstructured":"Topor, R. W., \u201cTermination Detection for Distributed Computations,\u201dInformation Processing Letters, 18, 1, 1984.","journal-title":"Information Processing Letters"},{"key":"BF03037504_CR12","doi-asserted-by":"crossref","unstructured":"Wah, B. W., Li, G. and Yu, C. F., \u201cMultiprocessing of Combinatorial Search Problems,\u201dIEEE Computer, 1985.","DOI":"10.1109\/MC.1985.1662926"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037504.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037504\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:38Z","timestamp":1558572758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["BF03037504"],"URL":"https:\/\/doi.org\/10.1007\/bf03037504","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}