{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T09:38:03Z","timestamp":1697967483882},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1007\/bf01918199","type":"journal-article","created":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T16:35:44Z","timestamp":1122050144000},"page":"105-123","source":"Crossref","is-referenced-by-count":1,"title":["A hybrid algorithm for solving convex separable network flow problems"],"prefix":"10.1007","volume":"29","author":[{"given":"Katharina","family":"Belling-Seib","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01918199_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230080405","volume":"8","author":"A. Ali","year":"1978","unstructured":"Ali, A., R. Helgason, J. Kennington, andH. Lall: Primal Simplex Network Codes: State-of-the-Art Implementation Technology. Networks8, 1978, 315\u2013338.","journal-title":"Networks"},{"key":"BF01918199_CR2","volume-title":"Nonlinear Programming \u2014 Theory and Algorithms","author":"M.S. Bazaraa","year":"1979","unstructured":"Bazaraa, M.S., andC.M. Shetty: Nonlinear Programming \u2014 Theory and Algorithms. John Wiley & Sons, New York 1979."},{"key":"BF01918199_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/nav.3800060106","volume":"6","author":"E.M.L. Beale","year":"1959","unstructured":"Beale, E.M.L.: An Algorithm for Solving the Transportation Problem when the Shipping Cost over each Route is Convex. Naval Research Logistics Quarterly6, 1959, 43\u201356.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF01918199_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"Bland, R.G.: New Finite Pivoting Rules for the Simplex Method. Mathematics of Operations Research2, 1977, 103\u2013107.","journal-title":"Mathematics of Operations Research"},{"key":"BF01918199_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.24.1.1","volume":"24","author":"G.H. Bradley","year":"1977","unstructured":"Bradley, G.H., G.G. Brown, andG.W. Graves: Design and Implementation of Large Scale Primal Transshipment Algorithms. Management Science24, 1977, 1\u201334.","journal-title":"Management Science"},{"key":"BF01918199_CR6","unstructured":"Belling-Seib, K.: Mathematische Programmierungsprobleme mit Netzwerkstruktur unter besonderer Ber\u00fccksichtigung von Netzwerkflu\u00dfproblemen mit konvexen, separablen Kostenverl\u00e4ufen. Dissertation am Fachbereich Wirtschaftswissenschaften der Freien Universit\u00e4t Berlin 1983."},{"key":"BF01918199_CR7","first-page":"227","volume":"51","author":"K. Belling-Seib","year":"1984","unstructured":"\u2014: Methods for Solving Nonlinear Network Flow Problems. Methods of Operations Research51, 1984, 227\u2013238.","journal-title":"Methods of Operations Research"},{"key":"BF01918199_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/nav.3800050304","volume":"5","author":"A. Charnes","year":"1958","unstructured":"Charnes, A., andW.W. Cooper: Nonlinear Network Flows and Convex Programming over Incidence Matrices. Naval Research Logistics Quarterly5, 1958, 231\u2013240.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF01918199_CR9","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1287\/mnsc.24.7.747","volume":"24","author":"M. Collins","year":"1978","unstructured":"Collins, M., L. Cooper, R. Helgason, J. Kennington, andL. LeBlanc: Solving the Pipe Network Analysis Problem Using Optimization Techniques. Management Science24, 1978, 747\u2013760.","journal-title":"Management Science"},{"key":"BF01918199_CR10","volume-title":"Technical Report IEOR 77012","author":"L. Cooper","year":"1977","unstructured":"Cooper, L., andJ. Kennington: Steady-State Analysis of Nonlinear Resistive Electrical Networks using Optimization Techniques. Technical Report IEOR 77012, Southern Methodist University Dallas, TX, 1977."},{"key":"BF01918199_CR11","volume-title":"Optimization Methods for Resource Allocation","year":"1974","unstructured":"Cottle, R., andJ. Krarup, ed.: Optimization Methods for Resource Allocation. The English Universities Press ltd, London 1974."},{"key":"BF01918199_CR12","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/trsc.5.4.366","volume":"5","author":"St. C. Dafermos","year":"1971","unstructured":"Dafermos, St. C.: An Extended Traffic Assignment Model with Applications to Two-Way Traffic. Transportation Science5, 1971, 366\u2013389.","journal-title":"Transportation Science"},{"key":"BF01918199_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0120941","volume":"15","author":"R.S. Dembo","year":"1981","unstructured":"Dembo, R.S., andJ.G. Klincewicz: A Scaled Reduced Gradient Algorithm for Network Flow with Convex Separable Costs. Mathematical Programming Study15, 1981, 125\u2013147.","journal-title":"Mathematical Programming Study"},{"key":"BF01918199_CR14","volume-title":"Practical Methods of Optimization. Volume 1: Unconstrained Optimization. Volume 2: Constrained Optimization","author":"R. Fletcher","year":"1980\/81","unstructured":"Fletcher, R.: Practical Methods of Optimization. Volume 1: Unconstrained Optimization. Volume 2: Constrained Optimization. John Wiley & Sons, Chichester 1980\/81."},{"key":"BF01918199_CR15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/trsc.11.2.166","volume":"11","author":"M. Florian","year":"1977","unstructured":"Florian, M.: A Traffic Equilibrium Model of Travel by Car and Public Transportation Modes. Transportation Science11, 1977, 166\u2013179.","journal-title":"Transportation Science"},{"key":"BF01918199_CR16","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1287\/trsc.10.4.374","volume":"10","author":"M. Florian","year":"1976","unstructured":"Florian, M., andS. Nguyen: An Application and Validation of Equilibrium Trip Assignment Methods. Transportation Science10, 1976, 374\u2013390.","journal-title":"Transportation Science"},{"key":"BF01918199_CR17","volume-title":"Numerical Methods for Constrained Optimization","author":"Ph.E. Gill","year":"1974","unstructured":"Gill, Ph.E., andW. Murray: Numerical Methods for Constrained Optimization. Academic Press, London 1974."},{"key":"BF01918199_CR18","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01583799","volume":"23","author":"Ph. E. Gill","year":"1982","unstructured":"Gill, Ph. E., W. Murray, M.A. Saunders, andM.H. Wright: A Note on a Sufficient-Decrease Criterion for a Non-Derivative Step-Length Procedure. Mathematical Programming23, 1982, 349\u2013352.","journal-title":"Mathematical Programming"},{"key":"BF01918199_CR19","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","volume":"4","author":"F. Glover","year":"1974","unstructured":"Glover, F., D. Karney, andD. Klingman: Implementation and Computational Comparisons of Primal, Dual, and Primal-Dual Computer Codes for Minimum Cost Network Flow Problems. Networks4, 1974, 191\u2013212.","journal-title":"Networks"},{"key":"BF01918199_CR20","volume-title":"Technical Report OREM 78001","author":"R. Helgason","year":"1978","unstructured":"Helgason, R., A. Ali, andJ. Kennington: The Convex Cost Network Flow Problem: A Survey of Algorithms. Technical Report OREM 78001, Southern Methodist University, Dallas, TX 1978."},{"key":"BF01918199_CR21","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1978","unstructured":"Horowitz, E., andS. Sahni: Fundamentals of Computer Algorithms. Pitman Publishing ltd, London 1978."},{"key":"BF01918199_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.3800130102","volume":"13","author":"T.C. Hu","year":"1966","unstructured":"Hu, T.C.: Minimum Cost Flows in Convex Cost Networks. Naval Research Logistics Quarterly13, 1966, 1\u20139.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF01918199_CR23","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.30.2.319","volume":"30","author":"C.L. Irwin","year":"1982","unstructured":"Irwin, C.L., andCh.W. Yang: Iteration and Sensitivity for a Spatial Equilibrium Problem with Linear Supply and Demand Functions. Operations Research30, 1982, 319\u2013335.","journal-title":"Operations Research"},{"key":"BF01918199_CR24","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","volume":"14","author":"M. Klein","year":"1967","unstructured":"Klein, M.: The Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problem. Management Science14, 1967, 205\u2013220.","journal-title":"Management Science"},{"key":"BF01918199_CR25","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"Klingman, D., A. Napier, andJ. Stutz: NETGEN, A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems. Management Science20, 1974, 814\u2013821.","journal-title":"Management Science"},{"key":"BF01918199_CR26","first-page":"1056","volume":"24","author":"D. Klingman","year":"1975","unstructured":"Klingman, D., andD. Karney: Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code. Operations Research24, 1975, 1056\u20131077.","journal-title":"Operations Research"},{"key":"BF01918199_CR27","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0041-1647(75)90030-1","volume":"9","author":"L. LeBlanc","year":"1975","unstructured":"LeBlanc, L., E. Morlok, andW. Pierskalla: An Efficient Approach to Solving Road Network Equilibrium Traffic Assignment Problems. Transportation Research9, 1975, 309\u2013318.","journal-title":"Transportation Research"},{"key":"BF01918199_CR28","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1287\/trsc.7.2.168","volume":"7","author":"T. Leventhal","year":"1973","unstructured":"Leventhal, T., G. Nemhauser, andL. Trotter jr.: A Column Generation Algorithm for Optimal Traffic Assignment. Transportation Science7, 1973, 168\u2013176.","journal-title":"Transportation Science"},{"key":"BF01918199_CR29","volume-title":"Introduction ot Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1973","unstructured":"Luenberger, D.G.: Introduction ot Linear and Nonlinear Programming. Addison-Wesley, Reading, MA, 1973."},{"key":"BF01918199_CR30","first-page":"465","volume-title":"Studies in Operations Management","author":"T.L. Magnanri","year":"1978","unstructured":"Magnanri, T.L., andB.L. Golden: Transportation Planning: Network Models and their Implementation. In: Studies in Operations Management; A.C. Hax ed., North-Holland Publ., Amsterdam 1978, 465\u2013517."},{"key":"BF01918199_CR31","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0120926","volume":"14","author":"R.R. Meyer","year":"1981","unstructured":"Meyer, R.R., andC.Y. Kao: Secant Approximation Methods for Convex Optimization. Mathematical Programming Study14, 1981, 143\u2013162.","journal-title":"Mathematical Programming Study"},{"key":"BF01918199_CR32","unstructured":"Murtagh, B.A.: Advanced Linear Programming: Computation and Practice. McGraw-Hill Inc., 1981."},{"key":"BF01918199_CR33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01588950","volume":"14","author":"B.A. Murtagh","year":"1978","unstructured":"Murtagh, B.A., andM.A. Saunders: Large-Scale Linearly Constrained Optimization. Mathematical Programming14, 1978, 41\u201372.","journal-title":"Mathematical Programming"},{"key":"BF01918199_CR34","volume-title":"Publication no. 171","author":"S. Nguyen","year":"1974","unstructured":"Nguyen, S.: Une Approche Unifi\u00e9e des Methodes d'Equilibre pour l'Affectation du Traffic. Publication no. 171, D\u00e9partment d'Informatique, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Quebec, 1974."},{"key":"BF01918199_CR35","volume-title":"Iterative Methods of Nonlinear Equations in Severable Variables","author":"J.M. Ortega","year":"1970","unstructured":"Ortega, J.M., andW.C. Rheinboldt: Iterative Methods of Nonlinear Equations in Severable Variables. Academic Press, New York 1970."},{"key":"BF01918199_CR36","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/net.3230140107","volume":"14","author":"J.-Sh. Pang","year":"1984","unstructured":"Pang, J.-Sh., andCH-S. Yu: A Special Spatial Equilibrium Problem. Networks14, 1984, 75\u201381.","journal-title":"Networks"},{"key":"BF01918199_CR37","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1287\/opre.29.4.763","volume":"29","author":"R.E. Rosenthal","year":"1981","unstructured":"Rosenthal, R.E.: A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydro-electronic Power System. Operations Research29, 1981, 763\u2013786.","journal-title":"Operations Research"},{"key":"BF01918199_CR38","first-page":"283","volume":"42","author":"P.A. Samuelson","year":"1952","unstructured":"Samuelson, P.A.: Spatial Price Equilibrium and Linear Programming. The American Economic Review42, 1952, 283\u2013303.","journal-title":"The American Economic Review"},{"key":"BF01918199_CR39","volume-title":"Spatial and Temporal Price and Allocation Models","author":"T. Takayama","year":"1971","unstructured":"Takayama, T., andG.G. Judge: Spatial and Temporal Price and Allocation Models. North-Holland Publ., Amsterdam 1971."},{"key":"BF01918199_CR40","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/net.3230100303","volume":"10","author":"A. Weintraub","year":"1980","unstructured":"Weintraub, A., andJ. Gonz\u00e1lez: An Algorithm for the Traffic Assignment Problem. Networks10, 1980, 197\u2013209.","journal-title":"Networks"}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01918199.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01918199\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01918199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:32:31Z","timestamp":1557448351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01918199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["BF01918199"],"URL":"https:\/\/doi.org\/10.1007\/bf01918199","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}