{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:23:41Z","timestamp":1743060221345,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48311-x_123","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"877-887","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Skeleton for Parallel Dynamic Programming"],"prefix":"10.1007","author":[{"given":"D.","family":"Morales","sequence":"first","affiliation":[]},{"given":"F.","family":"Almeida","sequence":"additional","affiliation":[]},{"given":"F.","family":"Garcia","sequence":"additional","affiliation":[]},{"given":"J.","family":"Gonzalez","sequence":"additional","affiliation":[]},{"given":"J.","family":"Roda","sequence":"additional","affiliation":[]},{"given":"C.","family":"Rodriguez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"unstructured":"Almeida F. Models in Parallel Dynamic Programming for the Discrete Case. PHDegree. DEIOC. Unniversidad de La Laguna. October 1996.","key":"123_CR1"},{"unstructured":"Andonov, Raimbault, Quinton. Dynamic Programming Parallel Implementations for the Knapsack Problem. Technical Report 740. IRISA. June 1993.","key":"123_CR2"},{"unstructured":"Bellman R. Dynamic Programming. Princeton U. P. 1957.","key":"123_CR3"},{"key":"123_CR4","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/0167-8191(92)90047-B","volume":"18","author":"G. Chen","year":"1992","unstructured":"Chen G., Jang J.. An Improved Parallel Algorithm for 0\/1 Knapsack Problems. Parallel Computing. 18. 811\u2013821. 1992.","journal-title":"Parallel Computing"},{"key":"123_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8191(93)90102-Q","volume":"19","author":"P. Edmonds","year":"1993","unstructured":"Edmonds P., Chu E., George A.. Dynamic Programming on a Shared Memory Multiprocessor. Parallel Computing. 19, 9\u201322. 1993.","journal-title":"Parallel Computing"},{"unstructured":"Gibbons A., Rytter W., Efficient Parallel Algorithms. Cambridge University Press. 1988.","key":"123_CR6"},{"unstructured":"Ibaraki T.. Enumerative Approaches to Combinatorial Optimization, Part II. Annals of Operations Research. Volume 11, N. 1-4, 1988.","key":"123_CR7"},{"key":"123_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0377-2217(88)90255-X","volume":"33","author":"G. Kindervater","year":"1988","unstructured":"Kindervater G., Trienekens H.. Experiments with Parallel Algorithms for Combinatorial Problems. European Journal of Operational Research. 33, 65\u201381. 1988.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"123_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"C-35","author":"D. Moldovan","year":"1986","unstructured":"Moldovan D., Fortes J. Partitioning and Mapping Algorithms into fixed size Systolic arrays. IEEE Trans. Comput. C-35(1), 1\u201312. 1986.","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"123_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/MC.1985.1662926","volume":"18","author":"B. Wah","year":"1985","unstructured":"Wah B., Li G., Fen C.. Multiprocessing of Combinatorial Search Problems. Computer. Vol. 18. 6, 93\u2013108. 1985.","journal-title":"Computer"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T14:42:12Z","timestamp":1600353732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_123","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}