{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:40:43Z","timestamp":1648924843523},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1973,6,1]],"date-time":"1973-06-01T00:00:00Z","timestamp":107740800000},"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,6]]},"DOI":"10.1007\/bf02252902","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T16:13:12Z","timestamp":1132071192000},"page":"125-136","source":"Crossref","is-referenced-by-count":12,"title":["Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen"],"prefix":"10.1007","volume":"11","author":[{"given":"W.","family":"Domschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02252902_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1287\/mnsc.6.2.187","volume":"6","author":"G. B. Dantzig","year":"1960","unstructured":"Dantzig, G. B.: On the shortest route through a network. Man. Sci.6, 187 (1960).","journal-title":"Man. Sci."},{"key":"BF02252902_CR2","doi-asserted-by":"crossref","unstructured":"Dantzig, G. B., W. O. Blattner and M. R. Rao: All shortest routes from a fixed origin in a graph. In: Th\u00e9orie des graphes, journ\u00e9es internationales d'\u00e9tude, Rome, juillet 1966 (V. Rosenstiehl, Hrsg.), S. 85. Paris-New York: 1967.","DOI":"10.21236\/AD0646552"},{"key":"BF02252902_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"Dijkstra, E. W.: A note on two problems in connection with graphs. Num. Math.1, 269 (1959).","journal-title":"Num. Math."},{"key":"BF02252902_CR4","volume-title":"K\u00fcrzeste Wege in Graphen: Algorithmen, Verfahrensvergleiche. (Mathematical Systems in Economics, Heft 2.)","author":"W. Domschke","year":"1972","unstructured":"Domschke, W.: K\u00fcrzeste Wege in Graphen: Algorithmen, Verfahrensvergleiche. (Mathematical Systems in Economics, Heft 2.) Meisenheim\/Glan: Hain. 1972."},{"key":"BF02252902_CR5","first-page":"26","volume":"11","author":"W. Domschke","year":"1972","unstructured":"Domschke, W.: Vergleich des Rechenaufwands der \u201cShortest-Route\u201d-Algorithmen von Ford, Bellman und Dijkstra. Oper. Res.-Verfahren11, 26 (1972).","journal-title":"Oper. Res.-Verfahren"},{"key":"BF02252902_CR6","unstructured":"Domschke, W.: Ein Algorithmus zur Bestimmung kostenminimaler Fl\u00fcsse in Kapazit\u00e4tendigraphen [erscheint in Oper. Res.-Verfahren15 (1973)]."},{"key":"BF02252902_CR7","unstructured":"Domschke, W.: Two new algorithms for minimal cost flow problems (erscheint in Computing)."},{"key":"BF02252902_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1287\/mnsc.17.5.307","volume":"17","author":"M. Florian","year":"1971","unstructured":"Florian, M., and P. Robert: A direct search method to locate negative cycles in a graph. Management Science17, 307 (1971).","journal-title":"Management Science"},{"key":"BF02252902_CR9","unstructured":"Ford, L. R. Jr.: Network flow theory. Rand Paper P-923. Santa Monica 1956."},{"key":"BF02252902_CR10","volume-title":"Structural models: An introduction to the theory of directed graphs","author":"F. Harary","year":"1965","unstructured":"Harary, F., R. Z. Norman, and D. Cartwright: Structural models: An introduction to the theory of directed graphs. New York-London-Sydney: Wiley. 1965."},{"key":"BF02252902_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-95121-3","volume-title":"Graphentheoretische Methoden und ihre Anwendungen","author":"W. Kn\u00f6del","year":"1969","unstructured":"Kn\u00f6del, W.: Graphentheoretische Methoden und ihre Anwendungen, S. 26. Berlin-Heidelberg-New York: Springer. 1969."},{"key":"BF02252902_CR12","first-page":"285","volume":"30","author":"E. F. Moore","year":"1959","unstructured":"Moore, E. F.: The shortest path through a maze. The Annals of the Computation Laboratory of Harvard University30, 285 (1959).","journal-title":"The Annals of the Computation Laboratory of Harvard University"},{"key":"BF02252902_CR13","unstructured":"Murchland, J. D.: Bibliography of the shortest route problem. London Business School. Transportation Network Theory Unit6.2 (1969)."},{"key":"BF02252902_CR14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/mnsc.19.3.333","volume":"19","author":"J. Y. Yen","year":"1972","unstructured":"Yen, J. Y.: On the efficiency of a direct search method to locate negative cycles in a network. Man. Sci.19, 333 (1972).","journal-title":"Man. Sci."}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252902.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252902\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T23:36:05Z","timestamp":1586561765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1973,6]]}},"alternative-id":["BF02252902"],"URL":"https:\/\/doi.org\/10.1007\/bf02252902","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1973,6]]}}}