{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:48:27Z","timestamp":1752461307431},"reference-count":10,"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>An important network optimization problem is to determine the routing of circuits and construction of additional are capacity in a communications network so as to satisfy forecasted circuit requirements at minimum cost. This paper considers the single\u2010time\u2010period version of the problem formulated as a linear program in the arc\u2010chain form. The special structure of this linear program is exploited to develop an efficient solution procedure. In particular, the generalized upper bounding technique devised by Dantzig and Van Slyke is applied. The computer implementation of the procedure is discussed and computational experience is reported. Brief mention is also made of certain extensions that are being pursued.<\/jats:p>","DOI":"10.1002\/net.3230070102","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T03:27:02Z","timestamp":1178854022000},"page":"1-23","source":"Crossref","is-referenced-by-count":20,"title":["A generalized upper bounding approach to a communications network planning problem"],"prefix":"10.1002","volume":"7","author":[{"suffix":"Jr.","given":"C. J.","family":"McCallum","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(67)80015-1"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.97"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010404"},{"key":"e_1_2_1_5_2","unstructured":"IBM Corporation \u201cMathematical Programming System Extended (MPSX) \u2010 Linear and Separable Programming Program Description \u201dProgram Manual SH20\u20130968\u20100 February1971."},{"key":"e_1_2_1_6_2","unstructured":"Jewell W. S. \u201cA Primal\u2010Dual Multicommodity Flow Algorithm \u201dTech. Report No. ORC 66\u201324 Operations Research Center University of California Berkeley September1966."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040406"},{"key":"e_1_2_1_8_2","unstructured":"Maier S. F. \u201cA Compact Inverse Scheme Applied to a Multicommodity Network with Resource Constraints \u201dReport No. 141 Department of Operations Research and Department of Statistics Stanford University Stanford California October1971."},{"key":"e_1_2_1_9_2","unstructured":"Saigal R. \u201cMulticommodity Flows in Directed Networks \u201dTech. Report No. ORC 67\u201338 Operations Research Center University of California Berkeley September1967."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.1.45"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010205"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230070102","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230070102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T10:32:00Z","timestamp":1699785120000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230070102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,3]]}},"alternative-id":["10.1002\/net.3230070102"],"URL":"https:\/\/doi.org\/10.1002\/net.3230070102","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]]}}}