{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:50:24Z","timestamp":1752461424527},"reference-count":21,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10816,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1977,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A variant of the revised simplex method is given for solving capacitated network flow problems with additional linear constraints. The mathematical development, computer implementation and computational experience are presented. The algorithm described uses a working basis of size equal to the number of additional linear constraints for pivoting, pricing, and inversion, which for large networks, can result in a substantial reduction of computation over a standard linear programming approach.<\/jats:p>","DOI":"10.1002\/net.3230070105","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T03:24:25Z","timestamp":1178853865000},"page":"59-79","source":"Crossref","is-referenced-by-count":43,"title":["A primal algorithm for solving a capacitated network flow problem with additional linear constraints"],"prefix":"10.1002","volume":"7","author":[{"given":"S.","family":"Chen","sequence":"first","affiliation":[]},{"given":"R.","family":"Saigal","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_3_2","unstructured":"Chen S.andR.Saigal \u201cA Starting Procedure for Bounded\u2010Variable Linear Programming Problems and a Modified Minimum Ratio Test \u201d submitted toMathematical Programming."},{"key":"e_1_2_1_4_2","volume-title":"Linear Prograrming and Extensions","author":"Dantzig G. B.","year":"1963"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(67)80015-1"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.6.2.171"},{"key":"e_1_2_1_8_2","first-page":"333","article-title":"A Generalized Upper Bounding Algorithm for Multicommodity Network Flow Problems","author":"Hartman J. K.","year":"1972","journal-title":"Networks"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.619"},{"key":"e_1_2_1_10_2","volume-title":"ORC66\u201324","author":"Kaul R. N.","year":"1966"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","DOI":"10.21236\/AD0774030","volume-title":"Finding Equivalent Network Formulations for Constrained Network Problems","author":"Klingman D.","year":"1973"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.1.91"},{"key":"e_1_2_1_13_2","volume-title":"The Art of Computer Programming, Volume 2, Seminumerical Algorithms","author":"Knuth D. E.","year":"1969"},{"key":"e_1_2_1_14_2","volume-title":"The Art of Computer Programming, Volume 3, Sorting and Searching","author":"Knuth D. E.","year":"1973"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800210407"},{"key":"e_1_2_1_16_2","volume-title":"Optimization Theory for Large Systems","author":"Lasdon L. S.","year":"1970"},{"key":"e_1_2_1_17_2","volume-title":"Working Paper No. 200","author":"McBride R.","year":"1973"},{"key":"e_1_2_1_18_2","volume-title":"Advanced Linear Programming Computing Techniques","author":"Orchard\u2010Hays W.","year":"1968"},{"key":"e_1_2_1_19_2","volume-title":"ORC66\u20139","author":"Saigal R.","year":"1966"},{"key":"e_1_2_1_20_2","unstructured":"Saigal R. \u201cMulticommodity Flows in Directed Networks \u201dPh.D. Thesis University of California Berkeley California 1968."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1137\/0115080"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230070105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230070105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T10:32:13Z","timestamp":1699785133000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230070105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,3]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,3]]}},"alternative-id":["10.1002\/net.3230070105"],"URL":"https:\/\/doi.org\/10.1002\/net.3230070105","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,3]]}}}