{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:50:30Z","timestamp":1699779030274},"reference-count":52,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1975,9,1]],"date-time":"1975-09-01T00:00:00Z","timestamp":178761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1975,9]]},"DOI":"10.1016\/0305-0548(75)90010-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"71-81","source":"Crossref","is-referenced-by-count":18,"title":["Past, present and future of large scale transshipment computer codes and applications"],"prefix":"10.1016","volume":"2","author":[{"given":"A.","family":"Charnes","sequence":"first","affiliation":[]},{"given":"David","family":"Karney","sequence":"additional","affiliation":[]},{"given":"D.","family":"Klingman","sequence":"additional","affiliation":[]},{"given":"Joel","family":"Stutz","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(75)90010-6_BIB1","unstructured":"Analysis, Research and Computation, Inc., Development and computational testing on a capacitated primal simplex transshipment code. ARC Technical Research Rept, P. O. Box 4067, Austin, Tex. 78765."},{"issue":"2","key":"10.1016\/0305-0548(75)90010-6_BIB2","first-page":"98","article-title":"On the transportation problem\u2014part I","volume":"4","author":"Balas","year":"1962","journal-title":"Cabiers du Centre d'Etudes de Recherche Operationelle"},{"issue":"3","key":"10.1016\/0305-0548(75)90010-6_BIB3","first-page":"131","article-title":"On the transportation problem\u2014part II","volume":"4","author":"Balas","year":"1962","journal-title":"Cabiers du Centre d'Etudes de Recherche Opertionelle"},{"key":"10.1016\/0305-0548(75)90010-6_BIB4","unstructured":"R. S. Barr, Streamlining primal simplex transportation codes, Research Rept. to appear in Center for Cybernetic Studies, University of Texas, Austin."},{"issue":"1","key":"10.1016\/0305-0548(75)90010-6_BIB5","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01585504","article-title":"An improved version of the out-of-kilter method and a comparative study of computer codes","volume":"7","author":"Barr","year":"1974","journal-title":"Mathl Programming"},{"issue":"9","key":"10.1016\/0305-0548(75)90010-6_BIB6","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1287\/mnsc.19.9.1042","article-title":"An efficient minimal cost flow algorithm","volume":"19","author":"Bennington","year":"1973","journal-title":"Mgmt Sci"},{"key":"10.1016\/0305-0548(75)90010-6_BIB7","article-title":"A procedure for determining a family of minimal-cost network flow patterns","author":"Busacker","year":"1961"},{"key":"10.1016\/0305-0548(75)90010-6_BIB8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/mnsc.1.1.49","article-title":"The stepping stone method of explaining linear programming calculations in transportation problems","volume":"7","author":"Charnes","year":"1954","journal-title":"Mgt Sci."},{"key":"10.1016\/0305-0548(75)90010-6_BIB9","volume":"2 Vols.","author":"Charnes","year":"1961"},{"issue":"1","key":"10.1016\/0305-0548(75)90010-6_BIB10","first-page":"5","article-title":"The dual method and the method of Balas and Ivanescu (Hammer) for the transportation model","volume":"6","author":"Charnes","year":"1964","journal-title":"Cabiers du Centre d'Etudes de Recherche Operationelle"},{"key":"10.1016\/0305-0548(75)90010-6_BIB11","article-title":"The numerical solution of network problems using the out-of-kilter algorithm","author":"Clasen","year":"1968"},{"key":"10.1016\/0305-0548(75)90010-6_BIB12","article-title":"Activity Analysis of Production and Allocation","author":"Dantzig","year":"1951"},{"key":"10.1016\/0305-0548(75)90010-6_BIB13","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/0305-0548(75)90010-6_BIB14","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/320924.320927","article-title":"A high-speed computer technique for the transportation problem","volume":"8","author":"Dennis","year":"1958","journal-title":"J. Assoc. comput. Mach."},{"key":"10.1016\/0305-0548(75)90010-6_BIB15","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0305-0548(75)90010-6_BIB16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/nav.3800080308","article-title":"A transportation algorithm and code","volume":"8","author":"Flood","year":"1961","journal-title":"Nov. Res. Logist. Q."},{"key":"10.1016\/0305-0548(75)90010-6_BIB17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/nav.3800040109","article-title":"A primal-dual algorithm for the capacitated Hitchcock problem","volume":"4","author":"Ford","year":"1957","journal-title":"Nov. Res. Logist. Q."},{"key":"10.1016\/0305-0548(75)90010-6_BIB18","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0109002","article-title":"An out-of-kilter method for solving minimal cost flow problems","volume":"9","author":"Fulkerson","year":"1961","journal-title":"J. Soc. Indust. appl. Math."},{"key":"10.1016\/0305-0548(75)90010-6_BIB19","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1287\/trsc.8.1.13","article-title":"An algorithm for combining truck trips","volume":"8","author":"Govish","year":"1974","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(75)90010-6_BIB20","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/nav.3800070206","article-title":"Coding and Transportation problem","volume":"7","author":"Glickman","year":"1960","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(75)90010-6_BIB21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","article-title":"Implementation and computational study on start procedures and basis change criteria for a primal network code","volume":"4","author":"Glover","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0305-0548(75)90010-6_BIB22","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1287\/trsc.6.2.171","article-title":"The augmented predecessor index method for locating stepping stone paths and assigning dual prices in distribution problems","volume":"6","author":"Glover","year":"1972","journal-title":"Transportation Sci."},{"key":"10.1016\/0305-0548(75)90010-6_BIB23","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1287\/mnsc.20.5.783","article-title":"A computational study on start procedures, basis change criteria, and solution algorithms for transportation problems","volume":"20","author":"Glover","year":"1974","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(75)90010-6_BIB24","series-title":"Double-pricing dual and feasible start algorithms for the capacitated transportation (distribution) problem","author":"Glover","year":"1970"},{"key":"10.1016\/0305-0548(75)90010-6_BIB25","article-title":"Equivalence of mixed integer programs and mixed integer generalized networks","author":"Glover","year":"1974","journal-title":"Research Rept. to appear Center For Cybernetics Studies, University of Texas, BEB-613"},{"key":"10.1016\/0305-0548(75)90010-6_BIB26","article-title":"Augmented threaded index method for network optimization","author":"Glover","year":"1974","journal-title":"INFOR"},{"key":"10.1016\/0305-0548(75)90010-6_BIB27","article-title":"Extensions of the augmented threaded index method","author":"Glover","year":"1974","journal-title":"Research Rept. C. S. 190, Center For Cybernetic Studies, University of Texas, BEB-613"},{"key":"10.1016\/0305-0548(75)90010-6_BIB28","doi-asserted-by":"crossref","first-page":"123","DOI":"10.6028\/jres.054.025","article-title":"An algorithm for solving the transportation problem","volume":"54","author":"Gleyzal","year":"1955","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"10.1016\/0305-0548(75)90010-6_BIB29","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1002\/sapm1941201224","article-title":"The distribution of a product from several sources to numerous localities","volume":"20","author":"Hitchcock","year":"1941","journal-title":"J. Math. Phys."},{"key":"10.1016\/0305-0548(75)90010-6_BIB30","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1287\/opre.14.4.619","article-title":"Networks and basic solutions","volume":"14","author":"Johnson","year":"1966","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(75)90010-6_BIB31","first-page":"199","article-title":"On the translocation of masses","volume":"37","author":"Kantorovich","year":"1942","journal-title":"Compt. rendu. Acad. Sci., U.S.S.R."},{"key":"10.1016\/0305-0548(75)90010-6_BIB32","article-title":"The application of mathematical methods to problems of freight flow analysis","author":"Kantorovich","year":"1949","journal-title":"Akademia Nauk SSSR"},{"key":"10.1016\/0305-0548(75)90010-6_BIB33","unstructured":"D. Karney and D. Klingman, Implementation and computational study on in-core out-of-core primal network code, to appear in Ops. Res."},{"key":"10.1016\/0305-0548(75)90010-6_BIB34","article-title":"Efficient computational devices for the capacitated transportation problem","author":"Kennington","year":"1975","journal-title":"Now. Res. Logist. Q."},{"key":"10.1016\/0305-0548(75)90010-6_BIB35","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","article-title":"A primal method for minimal cost flows","volume":"14","author":"Klein","year":"1967","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(75)90010-6_BIB36","unstructured":"D. Klingman, A. Napier and G. Ross, A computational study on the effects of problem dimensions on solution time for transportation problems, to appear in JACM."},{"key":"10.1016\/0305-0548(75)90010-6_BIB37","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"NETGEN\u2014a program for generating large scale (un) capacitated assignment, transportation, and minimum cost flow network problems","volume":"20","author":"Klingman","year":"1974","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(75)90010-6_BIB38","article-title":"Activity Analysis of Production and Allocation","author":"Koopmans","year":"1951"},{"key":"10.1016\/0305-0548(75)90010-6_BIB39","series-title":"Activity analysis of Production and Allocation","first-page":"222","article-title":"A model of transportation","author":"Koopmans","year":"1951"},{"key":"10.1016\/0305-0548(75)90010-6_BIB40","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(75)90010-6_BIB41","article-title":"An Experimental Study of the Transportation Algorithms","author":"Lee","year":"1968"},{"key":"10.1016\/0305-0548(75)90010-6_BIB42","series-title":"Column weighting factors and other enhancements to the augmented threaded index method for network optimization","author":"Mulvey","year":"1974"},{"key":"10.1016\/0305-0548(75)90010-6_BIB43","unstructured":"John Mulvey, Network relaxations for set covering, set partitioning and other integer programming problems, Research Rept, to appear Center for Cybernetic Studies University of Texas, BEB-613, Austin, Tex. 78765."},{"key":"10.1016\/0305-0548(75)90010-6_BIB44","first-page":"32","article-title":"Algorithms for the assignment and transportation problems","volume":"5","author":"Munkres","year":"1957","journal-title":"J. SIAM"},{"key":"10.1016\/0305-0548(75)90010-6_BIB45","unstructured":"Network Flow Routine, VIM\/FOCUS Library Number: H3 CODA NETFLOW; Control Data Corporation, Software Mfg. and Distribution, 215 Moffett Park Drive, Sunnyvale, California."},{"key":"10.1016\/0305-0548(75)90010-6_BIB46","series-title":"Out-of-Kilter Network Routine","year":"1967"},{"key":"10.1016\/0305-0548(75)90010-6_BIB47","article-title":"Accelerated labeling algorithms for the maximal flow problem with applications to transportation and assignment problems","author":"Rao","year":"1972"},{"key":"10.1016\/0305-0548(75)90010-6_BIB48","series-title":"Math. Programming","author":"Reinfeld","year":"1958"},{"key":"10.1016\/0305-0548(75)90010-6_BIB49","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/mnsc.2.2.156","article-title":"Current status of the industrial use of linear programming","volume":"2","author":"Smith","year":"1956","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(75)90010-6_BIB50","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/nav.3800010108","article-title":"Linear programming in bid evaluation","volume":"I","author":"Stanley","year":"1954","journal-title":"Nov. Res. Logist. Q."},{"key":"10.1016\/0305-0548(75)90010-6_BIB51","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/321752.321754","article-title":"Benefit-cost analysis of coding techniques for the primal transportation algorithm","volume":"20","author":"Srinivasan","year":"1973","journal-title":"ACM"},{"key":"10.1016\/0305-0548(75)90010-6_BIB52","unstructured":"UKILT-1100 Programmer Reference Manual, UNIVAC, Data Processing Division, Roseville, Minnesota."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054875900106?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054875900106?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:24:26Z","timestamp":1552926266000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054875900106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,9]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1975,9]]}},"alternative-id":["0305054875900106"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(75)90010-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1975,9]]}}}