{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:14:01Z","timestamp":1769314441490,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":[[1990,3]]},"DOI":"10.1007\/bf02247962","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T04:31:48Z","timestamp":1132029108000},"page":"21-34","source":"Crossref","is-referenced-by-count":36,"title":["\u03b5-Optimality for bicriteria programs and its application to minimum cost flows","\u03b5-Optimalit\u00e4t f\u00fcr bikriterielle Programme und Anwendung auf kostenminimale Fl\u00fcsse"],"prefix":"10.1007","volume":"44","author":[{"given":"G.","family":"Ruhe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Fruhwirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02247962_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02288322","volume":"13","author":"D. P. Bertsekas","year":"1988","unstructured":"Bertsekas, D. P., Tseng, P.: The Relax Codes for Linear Minimum Cost Network Flow Problems. Annals of Operations Research13, 125\u2013190 (1988).","journal-title":"Annals of Operations Research"},{"key":"BF02247962_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-6812-9","volume-title":"Analytische Geometrie","author":"W. Blaschke","year":"1954","unstructured":"Blaschke, W.: Analytische Geometrie. Birkh\u00e4user Verlag. Basel, Stuttgart (1954)."},{"key":"BF02247962_CR3","unstructured":"Burkard, R. E., Hamacher, H., Rote, G.: Approximation of Convex Functions and Applications in Mathematical Programming. Report 89-1987, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz (1987)."},{"key":"BF02247962_CR4","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0377-2217(89)90443-8","volume":"42","author":"B. Fruhwirth","year":"1989","unstructured":"Fruhwirth, B., Burkard, R. E., Rote, G.: Approximation of Convex Curves with Applications to the Bicriterial Minimum Cost Flow Problem. European J. of Oper. Res.42, 326\u2013338 (1989).","journal-title":"European J. of Oper. Res."},{"key":"BF02247962_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0121089","volume":"26","author":"M. D. Grigoriadis","year":"1986","unstructured":"Grigoriadis, M. D.: An efficient implementation of the network simplex method. Mathematical Programming Study26, 83\u2013111 (1986).","journal-title":"Mathematical Programming Study"},{"key":"BF02247962_CR6","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"Klingman, D., Napier, K., and Stutz, J.: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Problems. Management Science20, 814\u2013821 (1974).","journal-title":"Management Science"},{"key":"BF02247962_CR7","doi-asserted-by":"crossref","unstructured":"Orlin, J. B.: A Faster Strongly Polynomial Minimum Cost Flow Algorithm. Proc. 20th ACM Symp. on the Theory of Comp., 377\u2013387 (1988).","DOI":"10.21236\/ADA457044"},{"key":"BF02247962_CR8","unstructured":"Rote, G.: The Convergence Rate of the Dandwich Algorithm for Approximating Convex Functions. Report 118-1988, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz (1989)."},{"key":"BF02247962_CR9","unstructured":"Ruhe, G.: Fl\u00fcsse in Netzwerken\u2014Komplexit\u00e4t und Algorithmen. Dissertation B, Technische Hochschule Leipzig, Sektion Mathematik und Informatik. (1988)."},{"key":"BF02247962_CR10","first-page":"9","volume":"32","author":"G. Ruhe","year":"1988","unstructured":"Ruhe, G.: Complexity Results for Multicriterial and Parametric Networks Flows Using a Pathological Graph of Zadeh. Zeitschrift f\u00fcr Operations Research, Series A: Theory32, 9\u201327 (1988).","journal-title":"Zeitschrift f\u00fcr Operations Research, Series A: Theory"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247962.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02247962\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:41:19Z","timestamp":1558017679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02247962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF02247962"],"URL":"https:\/\/doi.org\/10.1007\/bf02247962","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}