{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:01:20Z","timestamp":1648620080961},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1973,9,1]],"date-time":"1973-09-01T00:00:00Z","timestamp":115689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1973,9]]},"DOI":"10.1007\/bf02252916","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T11:37:55Z","timestamp":1132054675000},"page":"275-285","source":"Crossref","is-referenced-by-count":7,"title":["Two new algorithms for minimal cost flow problems"],"prefix":"10.1007","volume":"11","author":[{"given":"W.","family":"Domschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02252916_CR1","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/364063.364085","volume":"11","author":"T. A. Bray","year":"1968","unstructured":"Bray, T. A., and C. Witzgall: Algorithm 336, netflow. Communications of the Association for Computing. Machinery11, 631 (1968).","journal-title":"Communications of the Association for Computing. Machinery"},{"key":"BF02252916_CR2","series-title":"Mathematical Systems in Economics","volume-title":"R\u00fcrzeste Wege in Graphen: Algorithmen, Verfahrensvergleiche","author":"W. Domschke","year":"1972","unstructured":"Domschke, W.: R\u00fcrzeste Wege in Graphen: Algorithmen, Verfahrensvergleiche Mathematical Systems in Economics, Heft 2, Meisenheim\/Glan: Hain. 1972."},{"key":"BF02252916_CR3","volume-title":"Ein Algorithmus zur Bestimmung kostenminimaler Fl\u00fcsse in Kapazit\u00e4tendigraphen. Operations Research-Verfahren","author":"W. Domschke","year":"1973","unstructured":"Domschke, W.: Ein Algorithmus zur Bestimmung kostenminimaler Fl\u00fcsse in Kapazit\u00e4tendigraphen. Operations Research-Verfahren (Meisenheim\/Glan: Hain)15 (1973)."},{"key":"BF02252916_CR4","first-page":"121","volume":"16","author":"W. Domschke","year":"1973","unstructured":"Domschke, W.: Ein neues Verfahren zur Bestimmung kostenminimaler Fl\u00fcsse in Kapazit\u00e4tendigraphen. Operations Research-Verfahren16, 121 (1973).","journal-title":"Operations Research-Verfahren"},{"key":"BF02252916_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02252902","volume":"11","author":"W. Domschke","year":"1973","unstructured":"Domschke, W.: Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen. Computing11, 125 (1973).","journal-title":"Computing"},{"key":"BF02252916_CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02252906","volume":"11","author":"W. Domschke","year":"1973","unstructured":"Domschke, W.: ALGOL-Prozedur f\u00fcr zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen. Computing11, 169 (1973).","journal-title":"Computing"},{"key":"BF02252916_CR7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0109002","volume":"9","author":"D. R. Fulkerson","year":"1961","unstructured":"Fulkerson, D. R.: An out-of-kilter method for minimal cost flow problems. J. Soc. Indust. Appl. Math.9, 18 (1961).","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"BF02252916_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","volume":"14","author":"M. Klein","year":"1967","unstructured":"Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Management Science14, 205 (1967).","journal-title":"Management Science"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252916.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252916\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T10:52:16Z","timestamp":1558003936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1973,9]]}},"alternative-id":["BF02252916"],"URL":"https:\/\/doi.org\/10.1007\/bf02252916","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1973,9]]}}}