{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:50:25Z","timestamp":1762210225719},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":[[1997,3]]},"DOI":"10.1016\/s0305-0548(96)00049-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"275-287","source":"Crossref","is-referenced-by-count":27,"title":["Routing and capacity assignment in backbone communication networks"],"prefix":"10.1016","volume":"24","author":[{"given":"Ali","family":"Amiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan","family":"Pirkul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00049-4_BIB1","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1147\/sj.182.0298","article-title":"Routing and flow control in system architecture","volume":"18","author":"Ahuja","year":"1979","journal-title":"IBM Sys. J."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB2","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","article-title":"A dual-ascent procedure for large scale uncapacitated network design","volume":"37","author":"Balakrishnan","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB3","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0377-2217(79)90228-5","article-title":"A survey of various tactics for generating Lagrangean multipliers in the context of Lagrangean duality","volume":"3","author":"Bazaraa","year":"1979","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB4","series-title":"Proc. 1980 Int. Conf. Circuits Comput.","article-title":"A class of optimal routing algorithms for communications networks","author":"Bertsekas","year":"1980"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-5316(81)90016-X","article-title":"An algorithm for the optimization of nonbifurcated flows in computer communication networks","volume":"1","author":"Courtois","year":"1981","journal-title":"Performance Evaluation J."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB6","series-title":"IEEE Computer Conf. Proc.","article-title":"The optimal routing of messages in a computer network via mathematical programming","author":"Cantor","year":"1972"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/net.3230010202","article-title":"Routing in computer network","volume":"1","author":"Frank","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","article-title":"The flow deviation method \u2014 an approach to store \u2014 and forward communication network design","volume":"3","author":"Fratta","year":"1973","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0305-0548(78)90018-7","article-title":"On obtaining the best' multipliers for a Lagrangean relaxation for integer programming","volume":"5","author":"Gavish","year":"1978","journal-title":"Comp. Oper. Res."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB10","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1109\/TCOM.1983.1095752","article-title":"An algorithm for optimal route selection in SNA networks","volume":"31","author":"Gavish","year":"1983","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB11","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/26.20116","article-title":"A system for routing and capacity assignment in computer networks","volume":"37","author":"Gavish","year":"1989","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB12","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/ijoc.2.3.236","article-title":"Backbone network design tools with economic tradeoffs","volume":"2","author":"Gavish","year":"1990","journal-title":"ORSA J. on Computing"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB13","article-title":"The design of store-and-forward (S\/F) networks for computer communications","author":"Gerla","year":"1973"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB14","series-title":"presented at the ACM-IEEE 3rd Data Communi. Symp.","article-title":"Deterministic and Adaptive Routing Policies in Packet Switched Networks","author":"Gerla","year":"1973"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB15","first-page":"149","article-title":"Joint optimization of data network design and facility location","volume":"8","author":"Gershet","year":"1990","journal-title":"IEEE J. on Selected Areas in Commun."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB16","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"5","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB17","series-title":"Communications nets: stochastic message flow and delay","author":"Kleinrock","year":"1964"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB18","volume":"Volumes 1\u20132","author":"Kleinrock","year":"1976"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1287\/ijoc.1.4.271","article-title":"Continuous models for capacity design of large packet\u2014 switched telecommunication networks","volume":"1","author":"LeBlanc","year":"1989","journal-title":"ORSA J. Comp."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB20","series-title":"Proc. Symp. on Computer Networks: Trends and Applications","article-title":"Flow assignment algorithm for computer communication network design with different classes of packets","author":"Maruyama","year":"1976"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB21","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","article-title":"Methods for designing communication networks with Certain two-connected survivability constraints","volume":"37","author":"Monma","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB22","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0169-7552(88)90048-7","article-title":"Route selection in backbone data communication networks","volume":"15","author":"Narasimhan","year":"1988","journal-title":"Comp. Networks and ISDN Sys."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB23","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/TCOM.1987.1096743","article-title":"Joint Optimization of Capacity and Flow Assignment in a Packet-Switched Communications Network","volume":"35","author":"Ng","year":"1987","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"10.1016\/S0305-0548(96)00049-4_BIB24","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/ijoc.6.1.50","article-title":"Primary and secondary route selection in backbone communication networks","volume":"6","author":"Pirkul","year":"1994","journal-title":"ORSA J. Comp."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB25","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0140-3664(94)90045-0","article-title":"Routing in packet-switched communication networks","volume":"17","author":"Pirkul","year":"1994","journal-title":"Comp. Commun."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB26","first-page":"593","article-title":"A general method of solving extremum problems","volume":"8","author":"Poljack","year":"1967","journal-title":"Soviet Math. Doklady"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB27","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1287\/opre.35.3.354","article-title":"A nonlinear programming heuristic for computing optimal link capacities in a multi-hour alternate routing communications network","volume":"35","author":"Rosenberg","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB28","series-title":"Discrete optimization algorithms with Pascal programs","author":"Syslo","year":"1983"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB29","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0169-7552(85)90001-7","article-title":"On the selection of primary paths for a communication network","volume":"9","author":"Tcha","year":"1985","journal-title":"Comp. Networks ISDN Sys."},{"key":"10.1016\/S0305-0548(96)00049-4_BIB30","series-title":"Proc. 1980 IEEE Int. Conf. on Circuits and Computers","first-page":"149","article-title":"Integer programming formulations of the traveling salesman problem","author":"Wong","year":"1980"},{"key":"10.1016\/S0305-0548(96)00049-4_BIB31","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","article-title":"A Dual Based Procedure for Solving Steiner Tree Problems on a Directed Graph","volume":"28","author":"Wong","year":"1984","journal-title":"Math. Programming"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000494?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000494?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:20:57Z","timestamp":1555190457000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0305054896000494"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00049-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}