{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,2,16]],"date-time":"2020-02-16T20:03:20Z","timestamp":1581883400815},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"URL":"http:\/\/www.springer.com\/tdm","start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"delay-in-days":0,"content-version":"tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1007\/bf01586040","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:49Z","timestamp":1114677349000},"page":"41-56","source":"Crossref","is-referenced-by-count":70,"title":["New scaling algorithms for the assignment and minimum mean cycle problems"],"prefix":"10.1007","volume":"54","author":[{"given":"James B.","family":"Orlin","sequence":"first","affiliation":[]},{"given":"Ravindra K.","family":"Ahuja","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.B. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).","volume-title":"The Design and Analysis of Computer Algorithms"},{"key":"CR2","author":"R.K. Ahuja","year":"1989","unstructured":"R.K. Ahuja, T.L. Magnanti and J.B. Orlin, \u201cNetwork flows,\u201d in:Handbooks in Operations Research and Management Science. Vol. I: Optimization (North-Holland, Amsterdam, 1989).","volume-title":"Handbooks in Operations Research and Management Science. Vol. I: Optimization"},{"key":"CR3","author":"D.P. Bertsekas","year":"1979","unstructured":"D.P. Bertsekas, \u201cA distributed algorithm for the assignment problem,\u201d Working Paper, Laboratory for Information and Decision Systems, MIT (Cambridge, MA, 1979).","series-title":"Working Paper","volume-title":"A distributed algorithm for the assignment problem"},{"key":"CR4","author":"D.P. Bertsekas","year":"1987","unstructured":"D.P. Bertsekas, \u201cThe auction algorithm: a distributed relaxation method for the assignment problem,\u201d Technical Report LIDS-P-1653, MIT (Cambridge, MA, 1987).","volume-title":"\u201cThe auction algorithm: a distributed relaxation method for the assignment problem,\u201d Technical Report LIDS-P-1653"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01589405","volume":"42","author":"D.P. Bertsekas","year":"1988","unstructured":"D.P. Bertsekas and J. Eckstein, \u201cDual coordinate step methods for linear network flow problems,\u201dMathematical Programming 42 (1988) 203\u2013243.","journal-title":"Mathematical Programming"},{"key":"CR6","author":"D.P. Bertsekas","year":"1989","unstructured":"D.P. Bertsekas and D.A. Castanon, \u201cThe auction algorithm for the minimum cost network flow problem,\u201d LIDS Technical Report, MIT (Cambridge, MA, 1989).","volume-title":"\u201cThe auction algorithm for the minimum cost network flow problem,\u201d LIDS Technical Report"},{"key":"CR7","first-page":"65","volume":"10","author":"L.D. Bodin","year":"1983","unstructured":"L.D. Bodin, B.L. Golden, A.A. Assad and M.O. Ball, \u201cRouting and scheduling of vehicles and crews,\u201dComputers and Operations Research 10 (1983) 65\u2013211.","journal-title":"Computers and Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R. Dial","year":"1969","unstructured":"R. Dial, \u201cAlgorithm 360: shortest path forest with topological ordering,\u201dCommunications of the ACM 12 (1969) 632\u2013633.","journal-title":"Communications of the ACM"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"E. Dijkstra, \u201cA note on two problems in connexion with graphs,\u201dNumerische Mathematik 1 (1959) 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"CR10","first-page":"1277","volume":"11","author":"E.A. Dinic","year":"1970","unstructured":"E.A. Dinic, \u201cAlgorithm for solution of a problem of maximum flow in networks with power estimation,\u201dSoviet Mathematics Doklady 11 (1970) 1277\u20131280.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S. Even","year":"1975","unstructured":"S. Even and R.E. Tarjan, \u201cNetwork flow and testing graph connectivity,\u201dSIAM Journal of Computing 4 (1975) 507\u2013518.","journal-title":"SIAM Journal of Computing"},{"key":"CR12","author":"R.L. Francis","year":"1974","unstructured":"R.L. Francis and J.A. White,Facility Location and Layout: An Analytical Approach (Prentice-Hall, Englewood Cliffs, NJ, 1974).","volume-title":"Facility Location and Layout: An Analytical Approach"},{"key":"CR13","unstructured":"M.L. Fredman and R.E. Tarjan, \u201cFibonacci heaps and their uses in network optimization algorithms,\u201dProceedings 25th Annual IEEE Symposium on Foundation of Computer Science (1984) pp. 338\u2013346.","DOI":"10.1109\/SFCS.1984.715934","doi-asserted-by":"crossref"},{"key":"CR14","unstructured":"H.N. Gabow and R.E. Tarjan, \u201cAlmost-optimum speed-ups of algorithms for bipartite matchings and related problems,\u201dProceedings of the 20th Annual ACM Symposium on Theory of Computing (1988) pp. 514\u2013527.","DOI":"10.1145\/62212.62263","doi-asserted-by":"crossref"},{"key":"CR15","unstructured":"A.V. Goldberg and R.E. Tarjan, \u201cSolving minimum cost flow problem by successive approximation,\u201dProceedings of the 19th ACM Symposium on the Theory of Computing (1987) pp 136\u2013146.","DOI":"10.1145\/28395.28397","doi-asserted-by":"crossref"},{"key":"CR16","unstructured":"A.V. Goldberg and R.E. Tarjan, \u201cFinding minimum-cost circulations by canceling negative cycles,\u201dProceedings of the 20th ACM Symposium on Theory of Computing (1988) pp. 388\u2013397.","DOI":"10.1145\/62212.62250","doi-asserted-by":"crossref"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"J.E. Hopcroft and R.M. Karp, \u201cAnn 5\/2 algorithm for maximum matching in bipartite graphs,\u201dSIAM Journal of Computing 2 (1973) 225\u2013231.","journal-title":"SIAM Journal of Computing"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"R.M. Karp","year":"1977","unstructured":"R.M. Karp, \u201cProbabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane,\u201dMathematics Operations Research 2 (1977) 209\u2013224.","journal-title":"Mathematics Operations Research"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R.M. Karp","year":"1977","unstructured":"R.M. Karp, \u201cA characterization of the minimum cycle mean in a digraph,\u201dDiscrete Mathematiccs 23 (1977) 309\u2013311.","journal-title":"Discrete Mathematiccs"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(81)90026-3","volume":"3","author":"R.M. Karp","year":"1981","unstructured":"R.M. Karp and J.B. Orlin, \u201cParametric shortest path algorithms with an application to cyclic staffing,\u201dDiscrete Applied Mathematics 3 (1981) 37\u201345.","journal-title":"Discrete Applied Mathematics"},{"key":"CR21","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, NY, 1976).","volume-title":"Combinatorial Optimization: Networks and Matroids"},{"key":"CR22","unstructured":"J.B. Orlin, \u201cThe complexity of dynamic languages and dynamic optimization problems,\u201dProceedings of the 13th Annual ACM Symposium on the Theory of Computing (1981) pp. 218\u2013227.","DOI":"10.1145\/800076.802475","doi-asserted-by":"crossref"},{"key":"CR23","author":"J.B. Orlin","year":"1987","unstructured":"J.B. Orlin and R.K. Ahuja, \u201cNew distance-directed algorithms for maximum flow and parametric maximum flow problems,\u201d Sloan, W.P. No. 1908\u201387, Sloan School of Management, MIT (Cambridge, MA, 1987).","series-title":"Sloan, W.P.","volume-title":"New distance-directed algorithms for maximum flow and parametric maximum flow problems"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E. Tardos","year":"1985","unstructured":"E. Tardos, \u201cA strongly polynomial minimum cost circulation algorithm,\u201dCombinatorica 5 (1985) 247\u2013255.","journal-title":"Combinatorica"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01840350","volume":"2","author":"E. Zemel","year":"1987","unstructured":"E. Zemel, \u201cA linear time randomizing algorithm for searching ranked functions,\u201dAlgorithmica 2 (1987) 81\u201390.","journal-title":"Algorithmica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01586040\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:35Z","timestamp":1556897555000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":25,"journal-issue":{"published-print":{"date-parts":[[1992,2]]},"issue":"1-3"},"alternative-id":["BF01586040"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01586040","relation":{"cites":[]},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":["Software","General Mathematics"]}}