{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:01:48Z","timestamp":1648800108326},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1975,6,1]],"date-time":"1975-06-01T00:00:00Z","timestamp":170812800000},"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":[[1975,6]]},"DOI":"10.1007\/bf02252864","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T16:15:23Z","timestamp":1132071323000},"page":"157-167","source":"Crossref","is-referenced-by-count":0,"title":["Anregungen aus dem Schnittebenenverfahren f\u00fcr die L\u00f6sung des allgemeinen Transportproblems"],"prefix":"10.1007","volume":"15","author":[{"given":"D.","family":"Braess","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02252864_CR1","unstructured":"Berge, C., Ghouila-Houri, A.: Programming, games and transportation networks. London-New York: 1965."},{"key":"BF02252864_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02234053","volume":"8","author":"D. Braess","year":"1971","unstructured":"Braess, D.: Die Bestimmung k\u00fcrzester Pfade in Graphen und passende Datenstrukturen. Computing8, 171\u2013181 (1971).","journal-title":"Computing"},{"key":"BF02252864_CR3","first-page":"57","volume":"16","author":"D. Braess","year":"1973","unstructured":"Braess, D.: A computational method for the nonlinear transportation problem. OR-Verfahren16, 57\u201367 (1973).","journal-title":"OR-Verfahren"},{"key":"BF02252864_CR4","unstructured":"Chojnacki, R.: Die Methode der Schnittebenen, angewandt auf das allgemeine Transportproblem. Diplomarbeit, M\u00fcnster, 1974."},{"key":"BF02252864_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-65286-8","volume-title":"Optimierungsaufgaben","author":"L. Collatz","year":"1971","unstructured":"Collatz, L., Wetterling, W.: Optimierungsaufgaben. Berlin-Heidelberg-New York: Springer. 1971."},{"key":"BF02252864_CR6","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R. B. Dial","year":"1969","unstructured":"Dial, R. B.: Shortest-path forest with topological ordering. Algorithm 360. Comm. ACM12, 632\u2013633 (1969).","journal-title":"Comm. ACM"},{"key":"BF02252864_CR7","unstructured":"Domschke, W.: K\u00fcrzeste Wege in Graphen: Algorithmen, Verfahrensvergleiche, 131 S. (Mathematical Systems in Economics Bd. 2.) Verlag Anton Hain."},{"key":"BF02252864_CR8","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 und (Algol-Prozeduren) 169\u2013173 (1973).","journal-title":"Computing"},{"key":"BF02252864_CR9","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":"BF02252864_CR10","first-page":"121","volume":"16","author":"W. Domschke","year":"1973","unstructured":"Domschke, W.: Ein neues Verfahren zur Bestimmung kostenminimaler Fl\u00fcsse in Kapazit\u00e4tendigraphen. OR-Verfahren16, 121\u2013127 (1973).","journal-title":"OR-Verfahren"},{"key":"BF02252864_CR11","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J. E. Kelley Jr.","year":"1960","unstructured":"Kelley, J. E., jr.: The cutting plane method for solving convex programs. SIAM J. Appl. Math.8, 703\u2013712 (1960).","journal-title":"SIAM J. Appl. Math."},{"key":"BF02252864_CR12","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. Berlin-Heidelberg-New York: Springer. 1969."},{"key":"BF02252864_CR13","first-page":"194","volume":"257","author":"G. Minty","year":"1960","unstructured":"Minty, G.: Monotone networks. Proc. Roy. Soc.A 257, 194\u2013212 (1960).","journal-title":"Proc. Roy. Soc."},{"key":"BF02252864_CR14","first-page":"25","volume":"7","author":"U. Pape","year":"1971","unstructured":"Pape, U.: K\u00fcrzeste Wege in Netzwerken zwischen festen Knoten. Ver\u00f6ffentlichungen des Instituts f\u00fcr Stadtbauwesen, Technische Universit\u00e4t Braunschweig7, 25\u201353 (1971).","journal-title":"Technische Universit\u00e4t Braunschweig"}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252864.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252864\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:52:15Z","timestamp":1558018335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1975,6]]}},"alternative-id":["BF02252864"],"URL":"https:\/\/doi.org\/10.1007\/bf02252864","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,6]]}}}