{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T05:03:42Z","timestamp":1777784622674,"version":"3.51.4"},"reference-count":46,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":[[1999,10]]},"DOI":"10.1016\/s0377-2217(98)00306-3","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"164-180","source":"Crossref","is-referenced-by-count":16,"title":["Algorithms for a multi-level network optimization problem"],"prefix":"10.1016","volume":"118","author":[{"given":"F.R.B.","family":"Cruz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.MacGregor","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.R.","family":"Mateus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00306-3_BIB1","unstructured":"E. Aarts, J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, Wiley, New York, 1989"},{"issue":"3","key":"10.1016\/S0377-2217(98)00306-3_BIB2","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/S0097539792236237","article-title":"When trees collide: An approximation algorithm for the generalized Steiner problem on networks","volume":"24","author":"Agrawal","year":"1995","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/mnsc.34.3.331","article-title":"Heuristics with constant error guarantees for the design of tree networks","volume":"32","author":"Altinkemer","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","article-title":"An integer linear programming approach to Steiner problem in graphs","volume":"10","author":"Aneja","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB5","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.4.2.192","article-title":"Using a hop-constrained model to generate alternative communication network design","volume":"4","author":"Balakrishnan","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB6","unstructured":"A. Balakrishnan, T.L. Magnanti, P. Mirchandani. Designing hierarchical survivable networks. Working Paper OR 291-94, Sloan School of Management, MIT, Cambridge, MA, 1994"},{"issue":"7","key":"10.1016\/S0377-2217(98)00306-3_BIB7","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.40.5.567","article-title":"A dual-based algorithm for multi-level network design","volume":"40","author":"Balakrishnan","year":"1994","journal-title":"Management Science"},{"issue":"7","key":"10.1016\/S0377-2217(98)00306-3_BIB8","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/mnsc.40.7.846","article-title":"Modeling and heuristic worst-case performance analysis of two-level network design problem","volume":"40","author":"Balakrishnan","year":"1994","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02071976","article-title":"Models for planning capacity expansion in local access telecommunication networks","volume":"33","author":"Balakrishnan","year":"1991","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB10","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","article-title":"A heuristic Lagrangean algorithm for the capacitated plant location problem","volume":"15","author":"Barcelo","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB11","doi-asserted-by":"crossref","unstructured":"T. Barrera, J. Griffith, G. Robins, T. Zhang, Closing the gap: Near-optimal Steiner trees in polynomial time. Technical Report CS-93-31, Department of Computer Science, University of Virginia, Charlottesville, VA, 1993","DOI":"10.1109\/ASIC.1993.410814"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB12","unstructured":"M.S. Bazaraa, J.J. Jarvis, H.D. Sherali. Linear Programming and Networks Flows, 2nd ed., Wiley, New York, 1990"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230190102","article-title":"An SST-based algorithm for the Steiner problem in graphs","volume":"19","author":"Beasley","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB14","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","article-title":"A tree search algorithm for the p-median problem","volume":"10","author":"Christofides","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB15","unstructured":"CPLEX Optimization, Using the CPLEXTM Callable Library and CPLEXTM Mixed Integer Library. CPLEX Optimization, Incline Village, NV, 1993"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB16","unstructured":"F.R.B. Cruz, J. MacGregor Smith, G.R. Mateus. A branch-and-bound algorithm to solve the multi-level network optimization problem. Technical Report RT030\/95, Departamento de Ci\u00eancia da Computa\u00e7ao, UFMG, Belo Horizonte, Brazil, 1995"},{"issue":"1","key":"10.1016\/S0377-2217(98)00306-3_BIB17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0305-0548(98)80010-5","article-title":"Solving to optimality the uncapacitated fixed-charge network flow problem","volume":"25","author":"Cruz","year":"1998","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB18","unstructured":"F.R.B. Cruz, G.R. Mateus, H.P.L. Luna, Algorithm for hierarchical network design, In TIMS\/ORSA Joint National Meeting, p. 64, Nashville, USA, 1991"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0377-2217(86)80007-8","article-title":"The hierarchical network design problem","volume":"27","author":"Current","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB20","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0377-2217(89)90170-7","article-title":"Reducing the hierarchical network design problem","volume":"39","author":"Duin","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB21","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/net.3230190506","article-title":"Reduction tests for the Steiner problem in graphs","volume":"19","author":"Duin","year":"1989","journal-title":"Networks"},{"issue":"6","key":"10.1016\/S0377-2217(98)00306-3_BIB22","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","article-title":"A dual-based procedure for uncapacitated facility location","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangean relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0377-2217(98)00306-3_BIB24","first-page":"57","article-title":"The use of Lagrangean relaxation in the solution of uncapacitated facility location problems","volume":"1","author":"Galv\u00e3o","year":"1993","journal-title":"Location Science"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB25","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02097805","article-title":"A method for solving to optimality uncapacitated location problems","volume":"18","author":"Galv\u00e3o","year":"1989","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB26","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB27","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02061657","article-title":"Topological design of telecommunication networks \u2013 Local access design methods","volume":"33","author":"Gavish","year":"1991","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB28","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"},{"issue":"3\/4","key":"10.1016\/S0377-2217(98)00306-3_BIB29","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02110085","article-title":"Efficient heuristics for the design of ring networks","volume":"4","author":"Gendreau","year":"1995","journal-title":"Telecommunication Systems"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB30","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","article-title":"Multicommodity distribution system design by Benders decomposition","volume":"20","author":"Geoffrion","year":"1974","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB31","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search - Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB32","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search - Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB33","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01582064","article-title":"The Steiner tree polytope and related polyhedra","volume":"63","author":"Goemans","year":"1994","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB34","unstructured":"M.X. Goemans, A.V. Goldeberg, S. Plotkin, D. Shmoys, \u00c9.Tardos, D.P. Williamson, Improved approximation algorithms for network design problems, in: Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 223\u2013232"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB35","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB36","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/net.3230190304","article-title":"Analysis of a flow problem with fixed charges","volume":"19","author":"Hochbaum","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB37","unstructured":"P.N. Klein, R. Ravi, A nearly best-possible approximation algorithm for node-weighted Steiner trees, in: Proc. 3rd Symposium on Integer Programming and Combinatorial Optimization, 1993, pp. 323\u2013332"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB38","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(87)90021-7","article-title":"The telephonic switching centre network problem: Formalization and computational experience","volume":"18","author":"Luna","year":"1987","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB39","first-page":"185","article-title":"The Steiner problem in graphs","volume":"31","author":"Maculan","year":"1987","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB40","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF02071983","article-title":"An approach for the Steiner problem in directed graphs","volume":"33","author":"Maculan","year":"1991","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB41","first-page":"297","article-title":"O problema de localiza\u00e7\u00e3o n\u00e3o capacitado: Modelos e algoritmos","volume":"2","author":"Mateus","year":"1992","journal-title":"Investigaci\u00f3n Operativa"},{"issue":"3","key":"10.1016\/S0377-2217(98)00306-3_BIB42","first-page":"149","article-title":"An algorithm for hierarchical network design","volume":"2","author":"Mateus","year":"1994","journal-title":"Location Science"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB43","unstructured":"G.R. Mateus, H.P.L. Luna, Combinatorial optimization in telephonic network planning, in: Workshop on Practical Combinatorial Optimization, Rio de Janeiro, Brazil, 1989, IFORS\/ALIO, pp. 40\u201354"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB44","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","article-title":"Network synthesis and optimum network design problems: Models, solution methods and applications","volume":"19","author":"Minoux","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB45","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988","DOI":"10.1002\/9781118627372"},{"key":"10.1016\/S0377-2217(98)00306-3_BIB46","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","article-title":"A dual ascent algorithm for the Steiner problem in directed graphs","volume":"28","author":"Wong","year":"1984","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003063?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003063?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T13:21:08Z","timestamp":1556112068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798003063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S0377221798003063"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00306-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}