{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:56:59Z","timestamp":1761893819804,"version":"3.41.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Mathematical Modelling and Algorithms"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1023670814370","type":"journal-article","created":{"date-parts":[[2003,6,6]],"date-time":"2003-06-06T17:55:35Z","timestamp":1054922135000},"page":"37-56","source":"Crossref","is-referenced-by-count":8,"title":["A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem"],"prefix":"10.1007","volume":"2","author":[{"given":"F. R. B.","family":"Cruz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. R.","family":"Mateus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"MacGregor Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5114271_CR1","volume-title":"Data Structures and Algorithms","author":"A. V. Aho","year":"1983","unstructured":"Aho, A. V., Hopcroft, J. E. and Ullman, J. D.: Data Structures and Algorithms, Addison-Wesley, Reading, Mass., 1983."},{"key":"5114271_CR2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y. P. Aneja","year":"1980","unstructured":"Aneja, Y. P.: An integer linear programming approach to the Steiner problem in graphs, Networks\n10 (1980), 167\u2013178.","journal-title":"Networks"},{"key":"5114271_CR3","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.4.2.192","volume":"4","author":"A. Balakrishnan","year":"1992","unstructured":"Balakrishnan, A. and Altinkemer, K.: Using a hop-constrained model to generate alternative communication network design, ORSA J. Comput.\n4 (1992), 192\u2013205.","journal-title":"ORSA J. Comput."},{"issue":"7","key":"5114271_CR4","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.40.5.567","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"Balakrishnan, A., Magnanti, T. L. and Mirchandani, P.: A dual-based algorithm for multi-level network design, Manag. Sci.\n40(7) (1994), 567\u2013581.","journal-title":"Manag. Sci."},{"issue":"7","key":"5114271_CR5","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/mnsc.40.7.846","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"Balakrishnan, A., Magnanti, T. L. and Mirchandani, P.: Modeling and heuristic worst-case performance analysis of two-level network design problem, Manag. Sci.\n40(7) (1994), 846\u2013867.","journal-title":"Manag. Sci."},{"issue":"1","key":"5114271_CR6","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/opre.46.1.116","volume":"46","author":"A. Balakrishnan","year":"1998","unstructured":"Balakrishnan, A., Magnanti, T. L. and Mirchandani, P.: Designing Hierarchical Survivable Networks, Oper. Res.\n46(1) (1998), 116\u2013136.","journal-title":"Oper. Res."},{"key":"5114271_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02071976","volume":"33","author":"A. Balakrishnan","year":"1991","unstructured":"Balakrishnan, A., Magnanti, T. L., Shulman, A. and Wong, R. T.: Models for planning capacity expansion in local access telecommunication networks, Ann. Oper. Res.\n33 (1991), 239\u2013284.","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"5114271_CR8","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1137\/S1052623494279134","volume":"6","author":"F. Barahona","year":"1996","unstructured":"Barahona, F.: Network design using cut inequalities, SIAM J. Optim.\n6(3) (1996), 823\u2013837.","journal-title":"SIAM J. Optim."},{"key":"5114271_CR9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","volume":"15","author":"J. Barcelo","year":"1984","unstructured":"Barcelo, J. and Casanovas, J.: A heuristic Lagrangian algorithm for the capacitated plant location problem, Europ. J. Oper. Res.\n15 (1984), 212\u2013226.","journal-title":"Europ. J. Oper. Res."},{"key":"5114271_CR10","volume-title":"Linear Programming and Networks Flows","author":"M. S. Bazaraa","year":"1990","unstructured":"Bazaraa, M. S., Jarvis, J. J. and Sherali, H. D.: Linear Programming and Networks Flows, 2nd edn, Wiley, New York, 1990.","edition":"2nd edn"},{"key":"5114271_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"J. E. Beasley","year":"1989","unstructured":"Beasley, J. E.: An SST-based algorithm for the Steiner problem in graphs, Networks\n19 (1989), 1\u201316.","journal-title":"Networks"},{"issue":"11","key":"5114271_CR12","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. E. Beasley","year":"1990","unstructured":"Beasley, J. E.: OR-library: distributing test problems by electronic Mail, J. Oper. Res. Soc.\n41(11) (1990), 1069\u20131072.","journal-title":"J. Oper. Res. Soc."},{"key":"5114271_CR13","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","volume":"10","author":"N. Christofides","year":"1982","unstructured":"Christofides, N. and Beasley, J. E.: A tree search algorithm for the P-median problem, Europ. J. Oper. Res.\n10 (1982), 196\u2013204.","journal-title":"Europ. J. Oper. Res."},{"issue":"1","key":"5114271_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0305-0548(98)80010-5","volume":"25","author":"F. R. B. Cruz","year":"1998","unstructured":"Cruz, F. R. B., MacGregor Smith, J. and Mateus, G. R.: Solving to optimality the uncapacitated fixed-charge network flow problem, Comp. Oper. Res.\n25(1) (1998), 67\u201381.","journal-title":"Comp. Oper. Res."},{"key":"5114271_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0377-2217(86)80007-8","volume":"27","author":"J. R. Current","year":"1986","unstructured":"Current, J. R., ReVelle, C. S. and Cohon, J. L.: The hierarchical network design problem, Europ. J. Oper. Res.\n27 (1986), 57\u201366.","journal-title":"Europ. J. Oper. Res."},{"key":"5114271_CR16","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0377-2217(89)90170-7","volume":"39","author":"C. W. Duin","year":"1989","unstructured":"Duin, C. W. and Volgenant, A.: Reducing the hierarchical network design problem, Europ. J. Oper. Res.\n39 (1989), 332\u2013344.","journal-title":"Europ. J. Oper. Res."},{"issue":"6","key":"5114271_CR17","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"Erlenkotter, D.: A dual-based procedure for uncapacitated facility location, Oper. Res.\n26(6) (1978), 992\u20131009.","journal-title":"Oper. Res."},{"key":"5114271_CR18","first-page":"1","volume":"27","author":"M. L. Fisher","year":"1980","unstructured":"Fisher, M. L.: The Lagrangian relaxation method for solving integer programming problems, Manag. Sci.\n27 (1980), 1\u201318.","journal-title":"Manag. Sci."},{"key":"5114271_CR19","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"M. L. Fisher","year":"1985","unstructured":"Fisher, M. L.: An application oriented guide to Lagrangian relaxation, Interfaces\n15 (1985), 10\u201321.","journal-title":"Interfaces"},{"key":"5114271_CR20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02097805","volume":"18","author":"R. D. Galv\u00e3o","year":"1989","unstructured":"Galv\u00e3o, R. D. and Raggi, L. A.: A method for solving to optimality uncapacitated location problems, Ann. Oper. Res.\n18 (1989), 225\u2013244.","journal-title":"Ann. Oper. Res."},{"key":"5114271_CR21","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979."},{"key":"5114271_CR22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B. Gavish","year":"1991","unstructured":"Gavish, B.: Topological design of telecommunication networks - local access design methods, Ann. Oper. Res.\n33 (1991), 17\u201371.","journal-title":"Ann. Oper. Res."},{"key":"5114271_CR23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0377-2217(92)90204-M","volume":"58","author":"B. Gavish","year":"1992","unstructured":"Gavish, B.: Topological design of computer communication networks - The overall design problem, Europ. J. Oper. Res.\n58 (1992), 149\u2013172.","journal-title":"Europ. J. Oper. Res."},{"key":"5114271_CR24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01582064","volume":"63","author":"M. X. Goemans","year":"1994","unstructured":"Goemans, M. X.: The Steiner tree polytope and related polyhedra, Math. Progr.\n63 (1994), 157\u2013182.","journal-title":"Math. Progr."},{"key":"5114271_CR25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"23","author":"M. X. Goemans","year":"1993","unstructured":"Goemans, M. X. and Myung, Y.: A catalog of Steiner tree formulations, Networks\n23 (1993), 19\u201328.","journal-title":"Networks"},{"key":"5114271_CR26","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M. and Karp, R.M.: The traveling salesman problem and minimum spanning trees, Oper. Res.\n18 (1970), 1138\u20131162.","journal-title":"Oper. Res."},{"key":"5114271_CR27","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/net.3230190304","volume":"19","author":"D. S. Hochbaum","year":"1989","unstructured":"Hochbaum, D. S. and Segev, A.: Analysis of a flow problem with fixed charges, Networks\n19 (1989), 291\u2013312.","journal-title":"Networks"},{"issue":"2","key":"5114271_CR28","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.46.2.247","volume":"46","author":"K. Holmberg","year":"1998","unstructured":"Holmberg, K. and Hellstrand, J.: Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound, Oper. Res.\n46(2) (1998), 247\u2013259.","journal-title":"Oper. Res."},{"issue":"6","key":"5114271_CR29","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1111\/j.1475-3995.1998.tb00135.x","volume":"5","author":"K. Holmberg","year":"1998","unstructured":"Holmberg, K. and Yuan, D.: A Lagrangian approach to network design problems, Internat. Trans. Oper. Res.\n5(6) (1998), 529\u2013539.","journal-title":"Internat. Trans. Oper. Res."},{"key":"5114271_CR30","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(87)90021-7","volume":"18","author":"H. P. L. Luna","year":"1987","unstructured":"Luna, H. P. L., Ziviani, N. and Cabral, R. M. B.: The telephonic switching centre network problem: Formalization and computational experience, Discrete Appl. Math.\n18 (1987), 199\u2013210.","journal-title":"Discrete Appl. Math."},{"key":"5114271_CR31","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF02071983","volume":"33","author":"N. Maculan","year":"1991","unstructured":"Maculan, N., Souza, P. and Vejar, A. C.: An approach for the Steiner problem in directed graphs, Ann. Oper. Res.\n33 (1991), 471\u2013480.","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"5114271_CR32","first-page":"149","volume":"2","author":"G. R. Mateus","year":"1994","unstructured":"Mateus, G. R., Cruz, F. R. B. and Luna, H. P. L.: An algorithm for hierarchical network design, Location Science\n2(3) (1994), 149\u2013164.","journal-title":"Location Science"},{"issue":"3- 4","key":"5114271_CR33","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1019147029476","volume":"15","author":"G. R. Mateus","year":"2000","unstructured":"Mateus, G. R. and Franqueira, R. V. L.: Model and heuristic for a generalized access network design problem, Telecom. Systems\n15(3- 4) (2000), 257\u2013271.","journal-title":"Telecom. Systems"},{"key":"5114271_CR34","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1009669927855","volume":"6","author":"G. R. Mateus","year":"2000","unstructured":"Mateus, G. R., Luna, H. P. L. and Sirihal, A. B.: Heuristic for distribution network design in telecommunication, J. Heuristics\n6 (2000), 131\u2013148.","journal-title":"J. Heuristics"},{"key":"5114271_CR35","doi-asserted-by":"crossref","unstructured":"Mateus, G. R., P\u00e1dua, C. I. P. S. and Luna, H. P. L.: Integrated network models for local access network design, In: Proc. Internat. Telecom. Sympos. 1996, Acapulco, Mexico, 1996, pp. 6\u201310.","DOI":"10.1109\/65.546357"},{"key":"5114271_CR36","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux, M.: Network synthesis and optimum network design problems: Models, solution methods and applications, Networks\n19 (1989), 313\u2013360.","journal-title":"Networks"},{"key":"5114271_CR37","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(93)90263-M","volume":"71","author":"R. L. Rardin","year":"1993","unstructured":"Rardin, R. L. and Wolsey, L. A.: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, Europ. J. Oper. Res.\n71 (1993), 95\u2013109.","journal-title":"Europ. J. Oper. Res."},{"key":"5114271_CR38","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018967121276","volume":"86","author":"S. Vo\u00df","year":"1999","unstructured":"Vo\u00df, S.: The Steiner tree problem with Hop constraints, Ann. Oper. Res.\n86 (1999), 321\u2013345.","journal-title":"Ann. Oper. Res."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1023670814370.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1023670814370\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1023670814370.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:23:49Z","timestamp":1749723829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1023670814370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5114271"],"URL":"https:\/\/doi.org\/10.1023\/a:1023670814370","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"type":"print","value":"1570-1166"},{"type":"electronic","value":"1572-9214"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}