{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:04:25Z","timestamp":1648955065844},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1976,6,1]],"date-time":"1976-06-01T00:00:00Z","timestamp":202435200000},"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":[[1976,6]]},"DOI":"10.1007\/bf02276757","type":"journal-article","created":{"date-parts":[[2005,12,9]],"date-time":"2005-12-09T02:46:07Z","timestamp":1134096367000},"page":"121-127","source":"Crossref","is-referenced-by-count":1,"title":["Ein graphentheoretischer Algorithmus f\u00fcr einige Flu\u00dfprobleme in Netzwerken mit Kantengewinnen"],"prefix":"10.1007","volume":"17","author":[{"given":"R.","family":"Horst","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02276757_CR1","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\u2013136 (1973).","journal-title":"Computing"},{"key":"BF02276757_CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02252906","volume":"11","author":"W. Domschke","year":"1973","unstructured":"Domschke, W.: Algol-Prozeduren f\u00fcr zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen. Computing11, 169\u2013173 (1973).","journal-title":"Computing"},{"key":"BF02276757_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02252916","volume":"11","author":"W. Domschke","year":"1973","unstructured":"Domschke, W.: Two new algorithms for minimal cost flow problems. Computing11, 275\u2013285 (1973).","journal-title":"Computing"},{"key":"BF02276757_CR4","series-title":"Erscheint in Operations Research-Verfahren","volume-title":"Maximale Netzwerkfl\u00fcsse mit Kantengewinnen","author":"R. Horst","year":"1975","unstructured":"Horst, R.: Maximale Netzwerkfl\u00fcsse mit Kantengewinnen. (Erscheint in Operations Research-Verfahren, 21.) Meisenheim\/Glan: Hain 1975."},{"key":"BF02276757_CR5","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/opre.10.4.476","volume":"10","author":"W. S. Jewell","year":"1962","unstructured":"Jewell, W. S.: Optimal Flow through Networks with Gains. Oper. Res.10, 476\u2013499 (1962).","journal-title":"Oper. Res."},{"key":"BF02276757_CR6","first-page":"171","volume":"10","author":"E. Minieka","year":"1972","unstructured":"Minieka, E.: Optimal Flow in a Network with Gains. Infor-CORS10, 171\u2013178 (1972).","journal-title":"Infor-CORS"}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276757.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02276757\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:33Z","timestamp":1557930513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02276757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976,6]]}},"alternative-id":["BF02276757"],"URL":"https:\/\/doi.org\/10.1007\/bf02276757","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,6]]}}}