{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:19:17Z","timestamp":1648631957310},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1964,9,1]],"date-time":"1964-09-01T00:00:00Z","timestamp":-168307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Unternehmensforschung Operations Research"],"published-print":{"date-parts":[[1964,9]]},"DOI":"10.1007\/bf01920856","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T08:09:53Z","timestamp":1122797393000},"page":"128-135","source":"Crossref","is-referenced-by-count":3,"title":["Primal- und Dual-Algorithmen zur Optimierung von Markov-Prozessen"],"prefix":"10.1007","volume":"8","author":[{"given":"Hartmut","family":"Wedekind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01920856_CR1","volume-title":"Dynamic Programming and Markov Processes","author":"R. A. Howard","year":"1960","unstructured":"R. A. Howard, Dynamic Programming and Markov Processes, Wiley, New York\u2014London 1960."},{"issue":"5","key":"BF01920856_CR2","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1287\/opre.10.5.702","volume":"10","author":"G. B. Dantzig","year":"1962","unstructured":"Dantzig, G. B., undP. Wolfe: Linear Programming in a Markov Chain, in: Operations Research, (1962), No. 5, Vol. 10, S. 702\u2013710.","journal-title":"Operations Research"},{"issue":"1","key":"BF01920856_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G. B. Dantzig","year":"1960","unstructured":"Dantzig, G. B., undP. Wolfe: Decomposition Principle for Linear Programs, in: Operations Research, (1960), No. 1, Vol. 8, S. 101\u2013111.","journal-title":"Operations Research"}],"container-title":["Unternehmensforschung Operations Research - Recherche Op\u00e9rationnelle"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01920856.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01920856\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01920856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:39:11Z","timestamp":1557448751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01920856"}},"subtitle":["Ein Vergleich der Algorithmen von Dantzig-Wolfe und Howard"],"short-title":[],"issued":{"date-parts":[[1964,9]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1964,9]]}},"alternative-id":["BF01920856"],"URL":"https:\/\/doi.org\/10.1007\/bf01920856","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1964,9]]}}}