{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:46:23Z","timestamp":1769813183177,"version":"3.49.0"},"reference-count":29,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":11971,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1974,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents extensive computational experience with a special purpose primal simplex algorithm. The performance is compared to that of several \u201cstate of the art\u201d out\u2010of\u2010kilter computer codes. The computational characteristics of several different primal feasible start procedures and pivot selection strategies are also examined.<\/jats:p><jats:p>The study discloses the advantages, in both computation time and memory requirements, of the primal approach over the out\u2010of\u2010kilter method. The test environment has the following distinguishing properties: (1) all of the codes are tested on the same machine and the same problems, (2) the test set includes capacitated and uncapacitated transhipment networks, transportation problems, and assignment problems, and (3) problem sizes ranging from 200 to 8,000 nodes with up to 35,000 arcs are examined.<\/jats:p>","DOI":"10.1002\/net.3230040302","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T01:49:11Z","timestamp":1178848151000},"page":"191-212","source":"Crossref","is-referenced-by-count":113,"title":["Implementation and computational comparisons of primal, dual and primal\u2010dual computer codes for minimum cost network flow problems"],"prefix":"10.1002","volume":"4","author":[{"given":"F.","family":"Glover","sequence":"first","affiliation":[]},{"given":"D.","family":"Karney","sequence":"additional","affiliation":[]},{"given":"D.","family":"Klingman","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","article-title":"An Improved Version of the Out\u2010of\u2010Kilter Method and a Comparative Study of Computer Codes","author":"Barr R. S.","journal-title":"Mathematical Programming"},{"key":"e_1_2_1_3_2","unstructured":"Bennington G. E. \u201cAn Efficient Minimal Cost Flow Algorithm \u201dO. R. Report 75 North Carolina State University Raleigh North Carolina June1972."},{"key":"e_1_2_1_4_2","volume-title":"Management Models and Industrial Applications of Linear Programming","author":"Charnes A.","year":"1961"},{"key":"e_1_2_1_5_2","unstructured":"Clasen R. J. \u201cThe Numerical Solution of Network Problems Using the Out\u2010of\u2010Kilter Algorithm \u201dRAND Corporation Memoramdum RM\u20105456\u2010PR Santa Monica California March 1968."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400884179"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/320924.320927"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800080308"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_10_2","unstructured":"Fong C. O.andM. R.Rao \u201cAccelerated Labeling Algorithms for the Maximal Flow Problem with Applications to Transportation and Assignment Problems \u201dW. P. No. 7222 Graduate School of Management University of Rochester December1972."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0109002"},{"key":"e_1_2_1_12_2","first-page":"1","article-title":"The Augmented Predecessor Index Method for Locating Stepping Stone Paths and Assigning Dual Prices in Distribution Problems","volume":"6","author":"Glover F.","year":"1972","journal-title":"Transprotation Science"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.783"},{"key":"e_1_2_1_14_2","unstructured":"Glover F. D.KarneyandD.Klingman \u201cDouble\u2010Pricing Dual and Feasible Start Algorithms for the Capacitated Transportation (distribution) Problem \u201d University of Texas at Austin 1970."},{"key":"e_1_2_1_15_2","first-page":"1","article-title":"An Efficient Dual Approach to Network Problems","volume":"9","author":"Glover F.","year":"1972","journal-title":"OPSEARCH"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.20.1.126"},{"key":"e_1_2_1_17_2","unstructured":"Glover F. D.KlingmanandJ.Stutz \u201cThe Augmented Threaded Index Method \u201dResearch Report CS 144 Center for Cybernetic Studies University of Texas Austin 1973."},{"key":"e_1_2_1_18_2","doi-asserted-by":"crossref","unstructured":"Glover F. D.KarneyandD.Klingman \u201cA Note on Computational Studies for Solving Transportation Problems \u201d Proc. of the ACM1973Conference Atlanta.","DOI":"10.1145\/800192.805671"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.619"},{"key":"e_1_2_1_20_2","unstructured":"Klingman D. A.NapierandG.Ross \u201cA Computational Study on the Effects of Problem Dimensions on Solution Time for Transportation Problems \u201dResearch Report CS 135 Center for Cybernetic Studies University of Texas Austin 1973."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.814"},{"key":"e_1_2_1_22_2","unstructured":"Langley R. W. \u201cContinuous and Integer Generalized Flow Problems \u201d Ph.D. dissertation School of Industrial and Systems Engineering Georgia Institute of Technology June1973."},{"key":"e_1_2_1_23_2","unstructured":"Lee S. \u201cAn Experimental Study of the Transportation Algorithms \u201d Master's Thesis Graduate School of Business University of California at Los Angeles 1968."},{"key":"e_1_2_1_24_2","unstructured":"\u201cNetwork Flow Routine \u201d YIM\/FOCUS Library Number H3 CODA NETFLOW; Control Data Corporation Software Mfg. and Distribution 215 Moffett Park Drive Sunnyvale California."},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2.3.276"},{"key":"e_1_2_1_26_2","volume-title":"SHARE Distribution 3536","year":"1967"},{"key":"e_1_2_1_27_2","volume-title":"Mathematical Programming","author":"Reinfield N. V.","year":"1958"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/321752.321754"},{"key":"e_1_2_1_29_2","unstructured":"\u201cUKILT\u20101100 Programmer Reference Manual \u201d UNIVAC Data Processing Division Roseville Minnesota."},{"key":"e_1_2_1_30_2","volume-title":"Principles of Operations Research","author":"Wagner H.","year":"1969"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230040302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230040302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T14:17:28Z","timestamp":1699798648000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230040302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,1]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,1]]}},"alternative-id":["10.1002\/net.3230040302"],"URL":"https:\/\/doi.org\/10.1002\/net.3230040302","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,1]]}}}