{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:30:39Z","timestamp":1725521439593},"publisher-location":"Boston, MA","reference-count":73,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387306629"},{"type":"electronic","value":"9780387301655"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-0-387-30165-5_14","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T12:26:59Z","timestamp":1228825619000},"page":"341-366","source":"Crossref","is-referenced-by-count":3,"title":["Optimization Issues in Distribution Network Design"],"prefix":"10.1007","author":[{"given":"Geraldo R.","family":"Mateus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Zenilton K. G.","family":"Patroc\u00ednio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","first-page":"149","volume":"81","author":"K. Aardal","year":"1998","unstructured":"K. Aardal. Capacitated facility location: Separation algorithms and computational experience. Mathematical Programming, 81:149\u2013175, 1998.","journal-title":"Mathematical Programming"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1287\/moor.20.3.562","volume":"20","author":"K. Aardal","year":"1995","unstructured":"K. Aardal, Y. Pochet, and L. A. Wolsey. Capacitated facility location: Valid inequalities and facets. Mathematics of Operations Research, 20:562\u2013582, 1995.","journal-title":"Mathematics of Operations Research"},{"key":"14_CR3","series-title":"Technical Report","volume-title":"When trees collide: An approximation algorithm for the generalized steiner problem on networks","author":"A. Agrawal","year":"1994","unstructured":"A. Agrawal, P.N. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized steiner problem on networks. Technical Report CS-90-32, Department of Computer Science, Brown University, Providence, Rhode Island 02912, 1994."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y.P. Aneja","year":"1980","unstructured":"Y.P. Aneja. An integer linear programming approach to Steiner problem in graphs. Networks, 10:167\u2013178, 1980.","journal-title":"Networks"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/mnsc.40.7.846","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"A. Balakrishnan, T.L. Magnanti, and P. Mirchandani. Modeling and heuristic worst-case performance analysis of two-level network design problem. Management Science, 40:846\u2013867, 1994.","journal-title":"Management Science"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02071976","volume":"33","author":"A. Balakrishnan","year":"1991","unstructured":"A. Balakrishnan, T.L. Magnanti, A. Shulman, and R.T. Wong. Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research, 33:239\u2013284, 1991.","journal-title":"Annals of Operations Research"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"A. Balakrishnan, T.L. Magnanti, and R.T. Wong. A dual-ascent procedure for large-scale uncapacitated network design. Operations Research, 37:716\u2013740, 1989.","journal-title":"Operations Research"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/0377-2217(88)90175-0","volume":"33","author":"J.E. Beasley","year":"1988","unstructured":"J.E. Beasley. An algorithm for solving large capacitated warehouse location problems. Journal of the Operational Research Society, 33:314\u2013325, 1988.","journal-title":"Journal of the Operational Research Society"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"J.E. Beasley","year":"1989","unstructured":"J.E. Beasley. An sst-based algorithm for the Steiner problem in graphs. Networks, 19: 1\u201316, 1989.","journal-title":"Networks"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF02136170","volume":"1","author":"D. Bienstock","year":"1993","unstructured":"D. Bienstock. Computational experience with an effective heuristic for some capacity expansion problems in local access networks. Telecommunication Systems, 1:379\u2013400, 1993a.","journal-title":"Telecommunication Systems"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1287\/moor.18.2.402","volume":"18","author":"D. Bienstock","year":"1993","unstructured":"D. Bienstock. A lot-sizing problem on trees, related to network design. Mathematics of Operations Research, 18:402\u2013422, 1993b.","journal-title":"Mathematics of Operations Research"},{"key":"14_CR12","first-page":"213","volume":"68","author":"D. Bienstock","year":"1995","unstructured":"D. Bienstock and O. G\u00fcnl\u00fck. Computational experience with a difficult mixed-integer multicommodity flow problem. Mathematical Programming, 68:213\u2013237, 1995.","journal-title":"Mathematical Programming"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D. Bienstock","year":"1996","unstructured":"D. Bienstock and O. G\u00fcnl\u00fck. Capacitated network design-polyhedral structure and computation. INFORMS Journal on Computing, 8:243\u2013259, 1996.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","volume":"25","author":"R.R. Boorstyn","year":"1977","unstructured":"R.R. Boorstyn and H. Frank. Large-scale network topological optimization. IEEE Transactions Communications, 25(1):29\u201347, 1977.","journal-title":"IEEE Transactions Communications"},{"key":"14_CR15","unstructured":"B. Brockm\u00fcller, O. G\u00fcnl\u00fck, and L. A. Wolsey. Designing private line networks-polyhedral analysis and computation. Technical report, CORE Discussion Paper, 1996."},{"key":"14_CR16","unstructured":"C.M.F. Carlson and Gerard Authie. Optimized design of LMDS cells: site location, equipment sizing and users homing. In Proceeding 3rd IEEE International Conference on Mobile and Wireless Communications Networks (MWCN\u20192001), pages 111\u2013118, Recife, Brazil, 2001."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/0377-2217(86)90244-4","volume":"23","author":"T.M. Cavalier","year":"1986","unstructured":"T.M. Cavalier and H.D. Sherali. Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree. European Journal of Operational Research, 23:246\u2013255, 1986.","journal-title":"European Journal of Operational Research"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"W. Chou, F. Ferrante, and L. Gerke. An algorithm for optimally locating network access facilities. In Proceedings of ICC\u2019 78, pages 24.5.1\u201324.5.8, 1978.","DOI":"10.1080\/09670877809414265"},{"key":"14_CR19","unstructured":"W. Cook. Integer programming solution for capacity expansion of the local access network. Technical Report TM-ARH-017914, Bell Communications Research, 1990."},{"key":"14_CR20","unstructured":"G. Dahl, A. Martin, and M. Stoer. Routing through virtual paths in layered telecommunication networks. Technical report, Telenor Research and Development, 1995."},{"issue":"3","key":"14_CR21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/nav.3800160306","volume":"16","author":"P.S. Davis","year":"1969","unstructured":"P.S. Davis and T.L. Ray. A branch and bound algorithm for the capacitated facilities location problem. Naval Research Logistic Quarterly, 16(3):331\u2013334, 1969.","journal-title":"Naval Research Logistic Quarterly"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1002\/net.3230190506","volume":"19","author":"C.W. Duin","year":"1989","unstructured":"C.W. Duin and A. Volgenant. Reduction tests for the Steiner problem in graphs. Networks, 19:549\u2013567, 1989.","journal-title":"Networks"},{"issue":"6","key":"14_CR23","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"D. Erlenkotter. A dual-based procedure for uncapacitated facility location. Operations Research, 26(6):992\u20131009, 1978.","journal-title":"Operations Research"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"B. Gavish. Topological design of centralized computer networks-formulations and algorithms. Networks, 12:355\u2013377, 1982.","journal-title":"Networks"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/322358.322367","volume":"30","author":"B. Gavish","year":"1983","unstructured":"B. Gavish. Formulations and algorithms for the capacitated minimal directed tree. Journal of the ACM, 30:118\u2013132, 1983.","journal-title":"Journal of the ACM"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B. Gavish","year":"1991","unstructured":"B. Gavish. Topological design of telecommunication networks-Local access design methods. Annals of Operations Research, 33:17\u201371, 1991.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","volume":"25","author":"M. Gerla","year":"1977","unstructured":"M. Gerla and L. Kleinrock. On the topological design of distributed computer networks. IEEE Transactions on Communications, 25(1):48\u201360, 1977.","journal-title":"IEEE Transactions on Communications"},{"issue":"4","key":"14_CR28","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"M. Gr\u00f6tschel and C. Monma. Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM Journal on Discrete Mathematics, 3(4):502\u2013523, 1990.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"14_CR29","unstructured":"M. Gr\u00f6tschel, C. Monma, and M. Stoer. Polyhedral approaches to network survivability. In DIMACS Series in Discete Mathematics and Theoretical Computer Science, volume 5. American Mathematical Society, Providence, Rhode Island, 1991."},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/opre.40.2.309","volume":"40","author":"M. Gr\u00f6tschel","year":"1992","unstructured":"M. Gr\u00f6tschel, C. Monma, and M. Stoer. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research, 40(2):309\u2013330, 1992a.","journal-title":"Operations Research"},{"issue":"3","key":"14_CR31","first-page":"474","volume":"2","author":"M. Gr\u00f6tschel","year":"1992","unstructured":"M. Gr\u00f6tschel, C. Monma, and M. Stoer. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM Journal on Optimization, 2(3):474\u2013504, 1992b.","journal-title":"Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM Journal on Optimization"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C. Monma, and M. Stoer. Design of survivable networks. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Handbooks in Operations Research and Management Science 7:Network Models. North-Holland, 1994.","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"14_CR33","unstructured":"O. G\u00fcnl\u00fck. A branch-and-cut algorithm for capacitated network design problem. Technical report, School of Operations Research and Industrial Engineering, Cornell University, 1996."},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S.L. Hakimi","year":"1964","unstructured":"S.L. Hakimi. Optimal locations of switching centers and the absolute centers and median of a graph. Operations Research, 12:450\u2013459, 1964.","journal-title":"Operations Research"},{"key":"14_CR35","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S.L. Hakimi","year":"1971","unstructured":"S.L. Hakimi. Steiner\u2019s problem in graphs and its implications. Networks, 1:113\u2013133, 1971.","journal-title":"Networks"},{"key":"14_CR36","volume-title":"Location on Networks-Theory and Algorithms","author":"G.Y. Handler","year":"1979","unstructured":"G.Y. Handler and P.B. Mirchandani. Location on Networks-Theory and Algorithms. The MIT Press, Cambridge, Massachusetts, 1979."},{"key":"14_CR37","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/0377-2217(95)00305-3","volume":"95","author":"J.W. Herrmann","year":"1996","unstructured":"J.W. Herrmann, G. Ioannou, I. Minis, and J. M. Proth. Fixed-charge capacitated network design problem. European Journal of Operational Research, 95:476\u2013490, 1996.","journal-title":"European Journal of Operational Research"},{"key":"14_CR38","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/net.3230190304","volume":"19","author":"D.S. Hochbaum","year":"1989","unstructured":"D.S. Hochbaum and A. Segev. Analysis of a flow problem with fixed charges. Networks, 19:291\u2013312, 1989.","journal-title":"Networks"},{"key":"14_CR39","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0377-2217(83)90195-9","volume":"12","author":"S.K. Jacobsen","year":"1983","unstructured":"S.K. Jacobsen. Heuristics for the capacitated plant location model. European Journal of Operational Research, 12:253\u2013261, 1983.","journal-title":"European Journal of Operational Research"},{"key":"14_CR40","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"J.B. Kruskal Jr.","year":"1956","unstructured":"J.B. Kruskal Jr. On the shortest spanning tree of a graph and the travelling salesman problem. Proc. Amer. Math. Society, 7:48\u201350, 1956.","journal-title":"Proc. Amer. Math. Society"},{"issue":"4","key":"14_CR41","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"A.A. Kuehn","year":"1963","unstructured":"A.A. Kuehn and M.J. Hamburger. A heuristic program for locating warehouses. Management Science, 9(4):643\u2013666, 1963.","journal-title":"Management Science"},{"key":"14_CR42","unstructured":"M. Laguna. Optimal design of sonet rings for interoffice telecommunication. Technical report, Graduate School of Business and Administration, University of Colorado, 1992."},{"key":"14_CR43","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01587093","volume":"44","author":"J.M.Y. Leung","year":"1989","unstructured":"J.M.Y. Leung and T.L. Magnanti. Valid inequalities and facets of the capacitated plant location problem. Mathematical Programming, 44:271\u2013291, 1989.","journal-title":"Mathematical Programming"},{"key":"14_CR44","unstructured":"L. Lov\u00e1sz and H. Scarf. The generalized basis reduction algorithm. Technical Report No. 946, Cowles Foundation Discussion Paper, Yale University, 1990."},{"key":"14_CR45","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0166-218X(87)90021-7","volume":"18","author":"H.P.L. Luna","year":"1987","unstructured":"H.P.L. Luna, N. Ziviani, and R.M.B. Cabral. The telephonic switching centre network problem: Formalization and computational experience. Discrete Applied Mathematics, 18:199\u2013210, 1987.","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR46","first-page":"185","volume":"31","author":"N. Maculan","year":"1987","unstructured":"N. Maculan. The Steiner problem in graphs. Annals of Discrete Mathematics, 31: 185\u2013212, 1987.","journal-title":"Annals of Discrete Mathematics"},{"key":"14_CR47","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"T.L. Magnanti, P. Mirchandani, and R. Vachani. The convex hull of two core capacitated network design problems. Mathematical Programming, 60:233\u2013250, 1993.","journal-title":"Mathematical Programming"},{"issue":"1","key":"14_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"T.L. Magnanti and R.T. Wong. Network design and transportation planning: Models and algorithms. Transactions Science, 18(1): 1\u201355, 1984.","journal-title":"Transactions Science"},{"key":"14_CR49","volume-title":"A discrete equal-capacity p-median problem","author":"V. Marathe","year":"1992","unstructured":"V. Marathe. A discrete equal-capacity p-median problem. Master\u2019s thesis, Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, 1992."},{"key":"14_CR50","first-page":"149","volume":"2","author":"G.R. Mateus","year":"1994","unstructured":"G.R. Mateus, F.R.B. Cruz, and H.P.L. Luna. Algorithm for hierarchical network design. Location Science, 2:149\u2013164, 1994.","journal-title":"Location Science"},{"key":"14_CR51","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1019147029476","volume":"15","author":"G.R. Mateus","year":"2000","unstructured":"G.R. Mateus and R.V.L. Franqueira. Model and heuristic for a generalized access network design problem. Telecommunication Systems, 15:257\u2013271, 2000.","journal-title":"Telecommunication Systems"},{"key":"14_CR52","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01581867","volume":"26","author":"G.R. Mateus","year":"1992","unstructured":"G.R. Mateus and H.P.L. Luna. Decentralized decision-making and capacitated facility location. The Annals of Regional Science, 26:361\u2013377, 1992.","journal-title":"The Annals of Regional Science"},{"key":"14_CR53","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/A:1009669927855","volume":"6","author":"G.R. Mateus","year":"2000","unstructured":"G.R. Mateus, H.P.L. Luna, and A.B. Sirihal. Heuristics for distribution network design in telecommunication. Journal of Heuristics, 6:131\u2013148, 2000.","journal-title":"Journal of Heuristics"},{"key":"14_CR54","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1023\/A:1025964603779","volume":"9","author":"F.F. Mazzini","year":"2003","unstructured":"F.F. Mazzini, G.R. Mateus, and J.M. Smith. Lagrangean based methods for solving large-scale cellular network design problems. Wireless Networks, 9:659\u2013672, 2003.","journal-title":"Wireless Networks"},{"issue":"1","key":"14_CR55","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TCOM.1977.1093710","volume":"25","author":"P.V. McGregor","year":"1977","unstructured":"P.V. McGregor and D. Shen. Network design: an algorithm for the access facility location problem. IEEE Transactions on Communications, 25(1):61\u201373, 1977.","journal-title":"IEEE Transactions on Communications"},{"key":"14_CR56","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"M. Minoux. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks, 19:313\u2013360, 1989.","journal-title":"Networks"},{"key":"14_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230150102","volume":"15","author":"A. Mirzaian","year":"1985","unstructured":"A. Mirzaian. Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds. Networks, 15:1\u201320, 1985.","journal-title":"Networks"},{"issue":"1","key":"14_CR58","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/opre.45.1.148","volume":"45","author":"Y. Myung","year":"1997","unstructured":"Y. Myung, H. Kim,, and D. Tcha. Optimal load balancing on sonet bidirectional rings. Operations Research, 45(1): 148\u2013152, 1997.","journal-title":"Operations Research"},{"key":"14_CR59","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"M.W. Padberg, T.J. Van Roy, and L.A. Wolsey. Valid linear inequalities for fixed charge problems. Operations Research, 33:842\u2013861, 1985.","journal-title":"Operations Research"},{"key":"14_CR60","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0167-6245(98)00007-9","volume":"10","author":"L. Pupillo","year":"1998","unstructured":"L. Pupillo and A. Conte. The economics of local loop architecture for multimedia services. Information Economics and Policy, 10:107\u2013126, 1998.","journal-title":"Information Economics and Policy"},{"key":"14_CR61","volume-title":"Tight relaxations of fixed charge network flow problems","author":"R.L. Rardin","year":"1982","unstructured":"R.L. Rardin. Tight relaxations of fixed charge network flow problems. Technical report, School of Industrial Engineering, Purdue University, West Lafayette, Indiana, 1982."},{"key":"14_CR62","series-title":"Technical Report","volume-title":"Tighter relaxations of fixed charge network flow problems","author":"R.L. Rardin","year":"1979","unstructured":"R.L. Rardin and U. Choe. Tighter relaxations of fixed charge network flow problems. Technical Report J-79-18, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, 1979."},{"key":"14_CR63","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0377-2217(93)90263-M","volume":"71","author":"R.L. Rardin","year":"1993","unstructured":"R.L. Rardin and L.A. Wolsey. Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. European Journal of Operational Research, 71:95\u2013109, 1993.","journal-title":"European Journal of Operational Research"},{"key":"14_CR64","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1287\/opre.17.6.1005","volume":"17","author":"G. Sa","year":"1969","unstructured":"G. Sa. Branch-and-bound and approximate solutions to the capacitated plant location problem. Operations Research, 17:1005\u20131016, 1969.","journal-title":"Operations Research"},{"key":"14_CR65","volume-title":"Limited column generation technique for several telecommunication network design problems","author":"D.X. Shaw","year":"1993","unstructured":"D.X. Shaw. Limited column generation technique for several telecommunication network design problems. Technical report, School of Industrial Engineering, Purdue University, West Lafayette, Indiana, 1993."},{"key":"14_CR66","volume-title":"Local access network design and its extensions","author":"D.X. Shaw","year":"1995","unstructured":"D.X. Shaw. Local access network design and its extensions. Technical report, School of Industrial Engineering, Purdue University, West Lafayette, Indiana, 1995."},{"key":"14_CR67","doi-asserted-by":"crossref","unstructured":"H.D. Sherali. Capacitated, balanced, sequential location-allocation problems on chains and trees. Mathematical Programming, pages 381\u2013396, 1991.","DOI":"10.1007\/BF01588799"},{"issue":"1","key":"14_CR68","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/trsc.22.1.70","volume":"22","author":"H.D. Sherali","year":"1988","unstructured":"H.D. Sherali and F.L. Nordai. A capacitated balanced 2-median problem on a tree network with a continuum of link demands. Transportation Science, 22(1):70\u201373, 1988.","journal-title":"Transportation Science"},{"key":"14_CR69","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/net.3230210202","volume":"21","author":"H.D. Sherali","year":"1991","unstructured":"H.D. Sherali and T.P. Rizzo. Unbalanced, capacitated p-median problems on a chain graph with a continuum of link demands. Networks, 21:133\u2013163, 1991.","journal-title":"Networks"},{"key":"14_CR70","unstructured":"A. Shulman, R. Vachani, J. Ward, and P. Kubat. Multicommodity flows in ring networks. Technical report, GTE Laboratories Inc., 1991."},{"key":"14_CR71","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"M. Stoer","year":"1994","unstructured":"M. Stoer and G. Dahl. A polyhedral approach to multicommodity survivable network design. Numerische Mathematik, 68:149\u2013167, 1994.","journal-title":"Numerische Mathematik"},{"key":"14_CR72","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/24.93762","volume":"40","author":"O.J. Wasem","year":"1991","unstructured":"O.J. Wasem. An algorithm for designing rings for survivable fiber network. IEEE Transactions on Reliability, 40:428\u2013432, 1991.","journal-title":"IEEE Transactions on Reliability"},{"key":"14_CR73","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"R.T. Wong. A dual ascent algorithm for the steiner problem in directed graphs. Mathematical Programming, 28:271\u2013287, 1984.","journal-title":"Mathematical Programming"}],"container-title":["Handbook of Optimization in Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30165-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T19:30:19Z","timestamp":1709753419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-30165-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780387306629","9780387301655"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30165-5_14","relation":{},"subject":[],"published":{"date-parts":[[2006]]}}}