{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:43:49Z","timestamp":1769813029246,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1974,12]]},"DOI":"10.1007\/bf01585504","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:09:11Z","timestamp":1114679351000},"page":"60-86","source":"Crossref","is-referenced-by-count":65,"title":["An improved version of the out-of-kilter method and a comparative study of computer codes"],"prefix":"10.1007","volume":"7","author":[{"given":"R. S.","family":"Barr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Klingman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/mnsc.10.3.578","volume":"10","author":"M.L. Balinski","year":"1964","unstructured":"M.L. Balinski and R.E. Gomory, \u201cA primal method for the assignment and transportation problem\u201d,Management Science 10 (1964) 578\u2013593.","journal-title":"Management Science"},{"key":"CR2","unstructured":"R.S. Barr, F. Glover and D. Klingman, \u201cAn imported version of the out-of-kilter method and a comparitive study of Computer Codes\u201d, C.S. Rept. 102, Center for Cybernetic Studies, BEB 512, The University of Texas, Austin, Texas."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"W.A. Briggs, \u201cAlgorithm 248 \u2014 Netflow (H)\u201d,Communications of the Association for Computing Machinery 8 (2) (1965).","DOI":"10.1145\/363744.363753"},{"key":"CR4","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J., 1963)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/320924.320927","volume":"8","author":"J.B. Dennis","year":"1958","unstructured":"J.B. Dennis, \u201cA high-speed computer technique for the transportation problem\u201d,Journal of the Association for Computing Machinery 8 (1958) 132\u2013153.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"D.W. Dijkstra","year":"1959","unstructured":"D.W. Dijkstra, \u201cA note on two problems in connexion with graphs\u201d,Numerische Mathematik 1 (1959) 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/nav.3800080308","volume":"8","author":"M.M. Flood","year":"1961","unstructured":"M.M. Flood, \u201cA transportation algorithm and code\u201d,Naval Research Logistics Quarterly 8 (1961) 257\u2013276.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR8","first-page":"194","volume-title":"Flows in networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"L.R. Ford, Jr. and D. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962) p. 194."},{"issue":"1","key":"CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/nav.3800040109","volume":"4","author":"L.R. Ford","year":"1957","unstructured":"L.R. Ford and D. Fulkerson, \u201cA primal-dual algorithm for the capacitated Hitchcock problem\u201d,Naval Research Logistics Quartely 4 (1) (1957) 47\u201354.","journal-title":"Naval Research Logistics Quartely"},{"key":"CR10","volume-title":"Communication, transmission, and transportation networks","author":"H. Frank","year":"1971","unstructured":"H. Frank and I.T. Frisch,Communication, transmission, and transportation networks (Addison-Wesley, Reading, Mass, 1971)."},{"issue":"2","key":"CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1080\/00029890.1966.11970730","volume":"73","author":"D.R. Fulkerson","year":"1966","unstructured":"D.R. Fulkerson, \u201cFlow networks and combinatorial operations research\u201d,American Mathematical Monthly 73 (2) (1966) 115\u2013138.","journal-title":"American Mathematical Monthly"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0109002","volume":"9","author":"D.R. Fulkerson","year":"1961","unstructured":"D.R. Fulkerson, \u201cAn out-of-kilter method for solving minimal cost flow problems\u201d,Journal of the Society for Industrial and Applied Mathemetics 9 (1961) 18\u201327.","journal-title":"Journal of the Society for Industrial and Applied Mathemetics"},{"key":"CR13","volume-title":"Perspectives on optimization: A collection of expository articles","year":"1972","unstructured":"A.M. Geoffrion, Ed.,Perspectives on optimization: A collection of expository articles (Addison Wesley, Reading, Mass, 1972)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/nav.3800070206","volume":"7","author":"S. Glickman","year":"1960","unstructured":"S. Glickman, L. Johnson and L. Eselson, \u201cCoding the transportation problem\u201d,Naval Research Logistics Quarterly 7 (1960) 169\u2013183.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"5","key":"CR15","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1287\/mnsc.20.5.783","volume":"20","author":"F. Glover","year":"1974","unstructured":"F. Glover, D. Karney, D. Klingman and A. Napier, \u201cA computations study on start procedures, basis change criteria, and solution algorithms for transportation problems\u201d,Management Science 20 (5) (1974) 793\u2013813.","journal-title":"Management Science"},{"key":"CR16","volume-title":"Double-pricing dual and feasible start algorithms for the capacitated transportation (distribution) problem","author":"F. Glover","year":"1970","unstructured":"F. Glover and D. Klingman, \u201cDouble-pricing dual and feasible start algorithms for the capacitated transportation (distribution) problem\u201d, University of Texas, Austin, Texas (1970)."},{"issue":"1","key":"CR17","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1287\/trsc.6.2.171","volume":"6","author":"F. Glover","year":"1972","unstructured":"F. Glover, D. Karney and D. Klingman, \u201cThe augmented predecessor index method for locating stepping stone paths and assigning dual prices in distribution problems\u201d,Transportation Science 6 (1) (1972) 171\u2013180.","journal-title":"Transportation Science"},{"issue":"9","key":"CR18","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1287\/mnsc.14.9.565","volume":"14","author":"M. Grigoriadis","year":"1968","unstructured":"M. Grigoriadis and W. Walker, \u201cA treatment of transportation problems by primal partition programming\u201d,Management Science 14 (9) (1968) 565\u2013599.","journal-title":"Management Science"},{"issue":"3","key":"CR19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","volume":"14","author":"M. Klein","year":"1967","unstructured":"M. Klein \u201cA primal method for minimal cost flows with applications to assignment and transportation problems\u201d,Management Science 14 (3) (1967) 205\u2013220.","journal-title":"Management Science"},{"issue":"5","key":"CR20","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"D. Klingman, A. Napier and J. Stutz, \u201cNETGEN \u2014 A program for generating large scale (un) capacitated assignment, transportation, and minimum cost flow network problems\u201d,Management Science 20 (5) (1974) 814\u2013821.","journal-title":"Management Science"},{"key":"CR21","volume-title":"An experimental study of the transportation algorithms","author":"S. Lee","year":"1968","unstructured":"S. Lee, \u201cAn experimental study of the transportation algorithms\u201d, Master's Thesis, Graduate School of Business, University of California, Los Angeles, Calif. (1968)."},{"issue":"1","key":"CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/mnsc.13.1.97","volume":"13","author":"M.-H. Mueller","year":"1966","unstructured":"M.-H. Mueller, \u201cAn improved starting algorithm for the Ford\u2014Fulkerson approach to the transportation problem\u201d,Management Science 13 (1) (1966) 97\u2013104.","journal-title":"Management Science"},{"key":"CR23","unstructured":"A. Napier, \u201cA computer generator for uncapacitated networks\u201d, unpublished."},{"key":"CR24","unstructured":"\u201cOPHELIE II: Mathematical programming system\u201d, Control Data Corporation Minneapolis, Minn. (1970)."},{"key":"CR25","unstructured":"\u201cOPHELIE\/LP: Linear programming subsystem of OPHELIE II\u201d, Control Data Corporation, Minneapolis, Minn. (1970)."},{"key":"CR26","unstructured":"\u201cOut-of-kilter network routine\u201d, SHARE Distribution 3536, SHARE Distribution Agency, Hawthorne, New York (1967)."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF01584092","volume":"1","author":"J.-M. Pla","year":"1971","unstructured":"J.-M. Pla, \u201cAn out-of-kilter algorithm for solving minimum cost potential problems\u201d,Mathematical Programming 1 (1971) 275\u2013290.","journal-title":"Mathematical Programming"},{"key":"CR28","volume-title":"Graphs and networks: An introduction","author":"W.L. Price","year":"1971","unstructured":"W.L. Price,Graphs and networks: An introduction (Auerbach, Princeton, N.J., 1971)."},{"key":"CR29","volume-title":"Linear programming","author":"M. Simonnard","year":"1966","unstructured":"M. Simonnard,Linear programming (Prentice-Hall, Englewood Cliffs, N.J., 1966)."},{"key":"CR30","volume-title":"Linear optimization","author":"W.A. Spivey","year":"1970","unstructured":"W.A. Spivey and R.M. Thrall,Linear optimization (Holt, Rinehart and Winston, New York, 1970)."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/321752.321754","volume":"20","author":"V. Srinivasan","year":"1973","unstructured":"V. Srinivasan and G.L. Thompson, \u201cBenefit-cost analysis of coding techniques for the primal transportation algorithm\u201d,Journal of the Association for Computing Machinery 20 (1973) 199\u2013213.","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585504.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585504\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:28Z","timestamp":1556897548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["BF01585504"],"URL":"https:\/\/doi.org\/10.1007\/bf01585504","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}