{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:07:45Z","timestamp":1649178465925},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T00:00:00Z","timestamp":1299628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10479-011-0858-7","type":"journal-article","created":{"date-parts":[[2011,3,8]],"date-time":"2011-03-08T17:45:44Z","timestamp":1299606344000},"page":"119-140","source":"Crossref","is-referenced-by-count":0,"title":["A least-squares minimum-cost network flow algorithm"],"prefix":"10.1007","volume":"186","author":[{"given":"Balaji","family":"Gopalakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seunghyun","family":"Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Earl","family":"Barnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ellis L.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel S.","family":"Sokol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,9]]},"reference":[{"key":"858_CR1","unstructured":"Aronson, J., Barr, R., Helgason, R., Kennington, J., Loh, A., & Zaki, H. (1985). The projective transformation algorithm of Karmarkar: a\u00a0computational experiment with assignment problem (Technical Report 85-OR-3). Department of operations research, Southern Methodist University, Dallas, TX."},{"key":"858_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0167-6377(02)00163-3","volume":"30","author":"E. Barnes","year":"2002","unstructured":"Barnes, E., Chen, V., Gopalakrishnan, B., & Johnson, E. L. (2002). A least squares primal-dual algorithm for solving linear programming problems. Operations Research Letters, 30, 289\u2013294.","journal-title":"Operations Research Letters"},{"key":"858_CR3","unstructured":"Beasly, J. E. OR-Library. Management School, Imperial College, London, http:\/\/mscmga.ms.ic.ac.uk\/info.html ."},{"issue":"4","key":"858_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02288322","volume":"1","author":"D. P. Bertsekas","year":"1988","unstructured":"Bertsekas, D. P., & Tseng, P. (1988a). The relax codes for linear minimum cost network flow problems. Annals of Operation Research, 1(4), 125\u2013190.","journal-title":"Annals of Operation Research"},{"issue":"4","key":"858_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/opre.36.1.93","volume":"36","author":"D. P. Bertsekas","year":"1988","unstructured":"Bertsekas, D. P., & Tseng, P. (1988b). Relaxation methods for minimum cost ordinary and generalized network flow problems. Operations Research, 36(4), 93\u2013114.","journal-title":"Operations Research"},{"key":"858_CR6","unstructured":"Bertsekas, D. P., & Tseng, P. (1994). RELAX-IV: a faster version of the RELAX code for solving minimum cost flow problems (MIT Technical Report, LIDS-P-2276)."},{"key":"858_CR7","series-title":"Kluwer\u2019s International Series in Operations Research & Management Science","volume-title":"Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice","author":"D. Bienstock","year":"2002","unstructured":"Bienstock, D. (2002). Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. Kluwer\u2019s International Series in Operations Research & Management Science."},{"key":"858_CR8","unstructured":"Bjorck, A. (1987). Least square methods. Working Paper. Department of Mathematics, Linkoping University, S-581 83 Linkoping, Sweden."},{"key":"858_CR9","volume-title":"Linear programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V. (1983). Linear programming. New York: Freeman."},{"key":"858_CR10","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.4.2.196","volume":"4","author":"W. H. Cunningham","year":"1979","unstructured":"Cunningham, W. H. (1979). Theoretical properties of the network simplex method. Mathematics of Operations Research, 4, 196\u2013208.","journal-title":"Mathematics of Operations Research"},{"issue":"22","key":"858_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"9","author":"Elizabeth D. Dolan","year":"2002","unstructured":"Dolan, Elizabeth D., & More, Jorge J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 9(22), 201\u2013213.","journal-title":"Mathematical Programming"},{"issue":"3","key":"858_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1287\/trsc.11.3.199","volume":"11","author":"C. O. Fong","year":"1977","unstructured":"Fong, C. O., & Srinivasan, V. (1977). Determining all nondegenerate shadow prices for the transportation problem. Transportation Science, 11(3), 199\u2013222.","journal-title":"Transportation Science"},{"issue":"3","key":"858_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.1040.0081","volume":"18","author":"A. Frangioni","year":"2006","unstructured":"Frangioni, A., & Manca, A. (2006). A computational study of cost reoptimization for min cost flow problems. INFORMS Journal on Computing, 18(3), 61\u201370.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"858_CR14","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1016\/j.cor.2008.01.001","volume":"36","author":"G. Geranis","year":"2009","unstructured":"Geranis, G., Paparrizos, K., & Sifaleras, A. (2009). On the computational behavior of a dual network exterior point simplex algorithm for the minimum cost network flow problem. Computers and Operations Research, 36(4), 1176\u20131190.","journal-title":"Computers and Operations Research"},{"key":"858_CR15","unstructured":"Goldberg, A. V., & Kharitonov, A. M. (1993). Implementing scaling push-relabel algorithms for the minimum-cost flow problem. Network, Flows and Matching: First DIMACS Implementation Challenge (pp.\u00a0157\u2013198)."},{"key":"858_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1995.0805","volume":"2","author":"A. V. Goldberg","year":"1997","unstructured":"Goldberg, A. V. (1997). An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 2, 1\u201329.","journal-title":"Journal of Algorithms"},{"key":"858_CR17","unstructured":"Gopalakrishnan, B. (2002). Least-squares methods in linear programming. Ph.D. Thesis, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta."},{"key":"858_CR18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0121089","volume":"26","author":"M. D. Grigoriadis","year":"1986","unstructured":"Grigoriadis, M. D. (1986). An efficient implementation of the network simplex method. Mathematical Programming Study, 26, 83\u2013111.","journal-title":"Mathematical Programming Study"},{"key":"858_CR19","volume-title":"Algorithms for network programming","author":"J. L. Kennington","year":"1980","unstructured":"Kennington, J. L., & Helgason, R. V. (1980). Algorithms for network programming. New York: Wiley."},{"key":"858_CR20","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, A., & Stutz, J. (1974). NETGEN\u2014a program for generating large scale capacitated assignment, transportation, and minimum cost flow networks. Management Science, 20, 814\u2013820.","journal-title":"Management Science"},{"key":"858_CR21","unstructured":"Kong, S. (2007). Linear programming algorithms using least-squares method. Ph.D. Thesis, ISYE, Georgia Institute of Technology, Atlanta."},{"key":"858_CR22","volume-title":"Solving least-squares problems","author":"C. L. Lawson","year":"1974","unstructured":"Lawson, C. L., & Hanson, R. J. (1974). Solving least-squares problems. New York: Prentice-Hall."},{"key":"858_CR23","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF02023107","volume":"47","author":"S. L. Leichner","year":"1993","unstructured":"Leichner, S. L., Dantzig, G. B., & Davis, J. W. (1993). A strictly improving linear programming phase I algorithm. Annals of Operation Research, 47, 409\u2013430.","journal-title":"Annals of Operation Research"},{"key":"858_CR24","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/62212.62249","volume-title":"Proceedings of the twentieth annual ACM symposium on theory of computing","author":"J. Orlin","year":"1988","unstructured":"Orlin, J. (1988). A faster strongly polynomial minimum cost flow algorithm. In Proceedings of the twentieth annual ACM symposium on theory of computing (pp. 377\u2013387)."},{"issue":"2","key":"858_CR25","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J. Orlin","year":"1993","unstructured":"Orlin, J. (1993). A faster strongly polynomial minimum cost flow algorithm. Operations Research, 41(2), 338\u2013350.","journal-title":"Operations Research"},{"key":"858_CR26","first-page":"109","volume":"78","author":"J. Orlin","year":"1997","unstructured":"Orlin, J. (1997). A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming, 78, 109\u2013129.","journal-title":"Mathematical Programming"},{"key":"858_CR27","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-T","volume":"35","author":"L. Portugal","year":"2000","unstructured":"Portugal, L., Resende, M., Veiga, G., Patr\u00edcio, J., & J\u00fadice, J. (2000). A truncated primal-infeasible dual-feasible network interior point method. Networks, 35, 91\u2013108.","journal-title":"Networks"},{"key":"858_CR28","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1590\/S0101-74382008000200005","volume":"28","author":"L. Portugal","year":"2008","unstructured":"Portugal, L., Resende, M., Veiga, G., Patr\u00edcio, J., & J\u00fadice, J. (2008). Fortran subroutines for network flow optimization using an interior point algorithm. Pesquisa Operacional, 28, 243\u2013261.","journal-title":"Pesquisa Operacional"},{"issue":"4","key":"858_CR29","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/trsc.23.4.231","volume":"23","author":"W. B. Powell","year":"1989","unstructured":"Powell, W. B. (1989). A review of sensitivity results for linear networks and a new approximation to reduce the effects of degeneracy. Transportation Science, 23(4), 231\u2013243.","journal-title":"Transportation Science"},{"key":"858_CR30","series-title":"DIMAC series in discrete mathematics and theoretical computer science","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1090\/dimacs\/012\/17","volume-title":"Network flow and matching: first DIMAC implementation challenge","author":"K. Ramakrishnan","year":"1993","unstructured":"Ramakrishnan, K., Karmarkar, N., & Kamath, A. (1993). An approximate dual projective algorithm for solving assignment problems. In Network flow and matching: first DIMAC implementation challenge. DIMAC series in discrete mathematics and theoretical computer science (vol.\u00a012, pp. 431\u2013451)."},{"key":"858_CR31","first-page":"81","volume":"3","author":"M. Resende","year":"1993","unstructured":"Resende, M., & Veiga, G. (1993). Computing the projection in an interior point algorithm: an experimental comparison. Investigacion Operativa, 3, 81\u201392.","journal-title":"Investigacion Operativa"},{"key":"858_CR32","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/11427186_41","volume":"3503","author":"J. Schwartz","year":"2005","unstructured":"Schwartz, J., Steger, A., & Wei\u00c3\u00fcl, A. (2005). Fast algorithms for weighted bipartite matching. Lecture Notes in Computer Science, 3503, 476\u2013487.","journal-title":"Lecture Notes in Computer Science"},{"issue":"3","key":"858_CR33","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E. Tardos","year":"1985","unstructured":"Tardos, E. (1985). A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5(3), 247\u2013255.","journal-title":"Combinatorica"},{"issue":"2","key":"858_CR34","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"Tardos, E. (1986). A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research, 34(2), 250\u2013256.","journal-title":"Operations Research"},{"key":"858_CR35","unstructured":"Wang, I. L. (2003). Shortest paths and multicommodity network flows. Ph.D. Thesis, ISYE, Georgia Institute of Technology, Atlanta."},{"key":"858_CR36","first-page":"11","volume-title":"Proceedings of the 31th annual ACM symposium on theory of computing","author":"K. Wayne","year":"1999","unstructured":"Wayne, K. (1999). A polynomial combinatorial algorithm for generalized minimum cost flow. In Proceedings of the 31th annual ACM symposium on theory of computing (pp. 11\u201318)."},{"key":"858_CR37","unstructured":"MP-TESTDATA: A collection of test data for various mathematical programming problems. http:\/\/elib.zib.de\/pub\/Packages\/mp-testdata\/ ."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0858-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0858-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0858-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T04:45:57Z","timestamp":1560055557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0858-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,9]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["858"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0858-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,9]]}}}