{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:04Z","timestamp":1761620764043},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":[[2000,9]]},"DOI":"10.1016\/s0377-2217(99)00272-6","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"622-632","source":"Crossref","is-referenced-by-count":31,"title":["Benders-and-cut algorithm for fixed-charge capacitated network design problem"],"prefix":"10.1016","volume":"125","author":[{"given":"Varadharajan","family":"Sridhar","sequence":"first","affiliation":[]},{"given":"June S.","family":"Park","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00272-6_BIB1","series-title":"Integer and Nonlinear Programming","first-page":"385","article-title":"Minimax and duality for linear and nonlinear mixed-integer programming","author":"Balas","year":"1970"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","article-title":"Capacitated network design-polyhedral structure and computation","volume":"8","author":"Bienstock","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","article-title":"A cutting plane algorithm for multicommodity survivable network design problems","volume":"10\/1","author":"Dahl","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0377-2217(92)90204-M","article-title":"Topological design of computer communication networks \u2013 the overall design problem","volume":"58","author":"Gavish","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB5","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1109\/49.62854","article-title":"Joint optimization of data network design and facility selection","volume":"8","author":"Gersht","year":"1990","journal-title":"IEEE Journal on Selected Areas of Communications"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB6","unstructured":"P. Gong, Capacitated network design with column generation, Ph.D. Thesis, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, CA, 1995"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB7","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/0377-2217(95)00305-3","article-title":"A dual ascent approach to the fixed-charge capacitated network design problem","volume":"95","author":"Herrmann","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB8","unstructured":"IBM, Optimization Subroutine Library: Guide and Reference (Release 2), IBM, Kingston, 1991"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1287\/ijoc.10.1.25","article-title":"Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms","volume":"10\/1","author":"Kaefer","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB10","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/26.81738","article-title":"MENTOR: An algorithm for mesh network topological optimization and routing","volume":"39","author":"Kershenbaum","year":"1991","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB11","series-title":"Discrete Location Theory","first-page":"263","article-title":"Covering problems","author":"Kolen","year":"1990"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02114284","article-title":"Topology design and bridge-capacity assignment for interconnecting token ring LANs: Simulated annealing approach","volume":"6","author":"LeBlanc","year":"1996","journal-title":"Telecommunication Systems"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02114283","article-title":"Design of capacitated networks with tree configurations","volume":"6","author":"Lee","year":"1996","journal-title":"Telecommunication Systems"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB14","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","article-title":"Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria","volume":"29\/3","author":"Magnanti","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB15","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0121090","article-title":"Tailoring Benders decomposition for network design","volume":"26","author":"Magnanti","year":"1986","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB16","unstructured":"T.L. Magnanti, P. Mirchandani, R. Vachani, Modeling and solving the capacitated network loading problem, unpublished mimeograph, 1991"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB17","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","article-title":"Modeling solving the two-facility capacitated network loading problem","volume":"43","author":"Magnanti","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB18","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB19","unstructured":"J.S. Park, L. LeBlanc, B.H. Lim, B.H., Virtual private network design using heterogeneous telecommunication services: SMDS and leased lines, in: Proceedings of the first international conference on telecommunications and electronic commerce, Nashville, TN, November 19\u201322, 1998"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB20","series-title":"Discrete Optimization","author":"Parker","year":"1988"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB21","unstructured":"V. Sridhar, Optimal design of interconnected local area networks, Ph.D. Thesis, Department of Management Sciences, The University of Iowa, Iowa City, IA, 1994"},{"key":"10.1016\/S0377-2217(99)00272-6_BIB22","doi-asserted-by":"crossref","unstructured":"V. Sridhar, J.S. Park, B. Gavish, LP-Based heuristic algorithms for interconnecting token rings via source routing bridges, Journal of Heuristics (to appear)","DOI":"10.1007\/978-1-4757-5392-9_8"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002726?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002726?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T10:53:08Z","timestamp":1555843988000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0377221799002726"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00272-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}