{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:42:30Z","timestamp":1781077350639,"version":"3.54.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0377-2217(02)00366-1","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T22:25:53Z","timestamp":1048631153000},"page":"126-140","source":"Crossref","is-referenced-by-count":20,"title":["New formulations and solution procedures for the hop constrained network design problem"],"prefix":"10.1016","volume":"148","author":[{"given":"Hasan","family":"Pirkul","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samit","family":"Soni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00366-1_BIB1","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1147\/sj.182.0298","article-title":"Routing and flow control in systems network architecture","volume":"18","author":"Ahuja","year":"1979","journal-title":"IBM Systems Journal"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB2","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0377-2217(95)00075-5","article-title":"Primary and secondary route selection in backbone communication networks","volume":"93","author":"Amiri","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB3","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1002\/j.1538-7305.1981.tb00297.x","article-title":"Design and optimization of networks with dynamic routing","volume":"60","author":"Ash","year":"1981","journal-title":"The Bell System Technical Journal"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB4","first-page":"4,192","article-title":"Using a hop constrained model to generate alternative communications network design","author":"Balakrishnan","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB5","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1287\/opre.44.3.478","article-title":"Heuristics, LPs and trees on trees: Network design analyses","volume":"44","author":"Balakrishnan","year":"1996","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00366-1_BIB6","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/opre.46.1.116","article-title":"Designing hierarchical survivable networks","volume":"46","author":"Balakrishnan","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB7","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1109\/TCOM.1984.1096159","article-title":"Second derivative algorithms for minimum delay distributed routing in networks","volume":"COM-32","author":"Bertsekas","year":"1984","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/net.3230010202","article-title":"Routing in computer networks","volume":"1","author":"Frank","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/S0377-2217(97)00217-8","article-title":"Iterative improvement methods for a multi-period network design problem","volume":"110","author":"Garcia","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/ijoc.2.3.236","article-title":"Backbone network design with economic tradeoffs","volume":"2","author":"Gavish","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00366-1_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":"COM-37","author":"Gavish","year":"1989","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB12","series-title":"Presented at the ACM-IEEE Third Data Communications Symposium, Tampa, Florida","article-title":"Deterministic and adaptive routing policies in packet switched networks","author":"Gerla","year":"1973"},{"issue":"2","key":"10.1016\/S0377-2217(02)00366-1_BIB13","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","article-title":"Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints","volume":"10","author":"Gouveia","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/opre.40.2.309","article-title":"Computational results with a cutting plane algorithm for designing communication networks with low connectivity constraints","volume":"40","author":"Gr\u00f6tschel","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB15","series-title":"Combinatorial optimization: Networks and matroids","author":"Lawler","year":"1976"},{"issue":"2","key":"10.1016\/S0377-2217(02)00366-1_BIB16","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/ijoc.11.2.188","article-title":"Packet routing in telecommunication networks with path and flow restrictions","volume":"11","author":"LeBlanc","year":"1999","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB17","unstructured":"LeBlanc, L.J., Narasimhan, S., Ran, B. Planning models for wide-area communication network design with response-time-dependent offered traffic. Information Technology and Management, in press"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB18","unstructured":"Level 3 Communications, 2000. Private communication"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB19","series-title":"Proceedings of the Third International Computers and Communications Conference","first-page":"92","article-title":"Discrete link capacity assignment in communication networks","author":"Maruyama","year":"1976"},{"issue":"4","key":"10.1016\/S0377-2217(02)00366-1_BIB20","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","article-title":"Methods for designing communications networks with certain two connected survivability","volume":"37","author":"Monma","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB21","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1109\/JSAC.1986.1146400","article-title":"Backbone network design and performance analysis: A methodology for packet switching networks","volume":"SAC-4","author":"Monma","year":"1986","journal-title":"IEEE Journals on Selected Areas in Communications"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB22","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB23","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1002\/(SICI)1520-6750(199708)44:5<485::AID-NAV6>3.0.CO;2-0","article-title":"Routing in packet switched communications networks with different criticality classes of communicating node pairs","volume":"44","author":"Pirkul","year":"1997","journal-title":"Naval Research Logistics"},{"issue":"1","key":"10.1016\/S0377-2217(02)00366-1_BIB24","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/ijoc.6.1.50","article-title":"Primary and secondary route selection in backbone computer networks","volume":"6","author":"Pirkul","year":"1994","journal-title":"ORSA Journal on Computing"},{"issue":"12","key":"10.1016\/S0377-2217(02)00366-1_BIB25","doi-asserted-by":"crossref","first-page":"S235","DOI":"10.1287\/mnsc.44.12.S235","article-title":"An efficient procedure for designing single allocation hub and spoke systems","volume":"44","author":"Pirkul","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB26","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","article-title":"Tight linear programming relaxations of uncapacitated p-hub median problems","volume":"94","author":"Skorin-Kapov","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB27","unstructured":"Standard and Poor\u2019s Industry Surveys, Telecommunications, 2000"},{"key":"10.1016\/S0377-2217(02)00366-1_BIB28","unstructured":"Verizon Communications, 2000. Private communication"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702003661?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702003661?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T02:57:24Z","timestamp":1554778644000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702003661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0377221702003661"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00366-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}