{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T09:53:41Z","timestamp":1778579621936,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":[[2001,8]]},"DOI":"10.1016\/s0377-2217(00)00143-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:50Z","timestamp":1027634690000},"page":"539-552","source":"Crossref","is-referenced-by-count":43,"title":["A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem"],"prefix":"10.1016","volume":"132","author":[{"given":"Lu\u0131\u0301s","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Requejo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00143-0_BIB1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","article-title":"An algorithm for the Steiner problem in graphs","volume":"14","author":"Beasley","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","article-title":"Bundle-based relaxation methods for multicommodity capacitated fixed charge network design","volume":"112","author":"Crainic","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0167-6377(98)00029-7","article-title":"The 2-hop spanning tree problem","volume":"23","author":"Dahl","year":"1998","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB4","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.5.4.426","article-title":"An efficient algorithm for the min-sum arborescence problem on complete digraphs","volume":"5","author":"Fischetti","year":"1993","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB5","series-title":"Telecommunications Network Planning","article-title":"Multicommodity capacitated network design","author":"Gendron","year":"1999"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB6","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0305-0548(94)00074-I","article-title":"Using the Miller\u2013Tucker\u2013Zemlin constraints to formulate a minimal spanning tree problem with hop constraints","volume":"22","author":"Gouveia","year":"1995","journal-title":"Computer and Operations Research"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB7","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","article-title":"Multicommodity flow models for spanning trees with hop constraints","volume":"95","author":"Gouveia","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB8","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(00)00143-0_BIB9","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB10","doi-asserted-by":"crossref","unstructured":"Holmberg, K., Yuan, D., 1996. A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Research Report LiTH-MAT-R-1996-23, Department of Mathematics, Link\u00f6ping Institute of Technology, Link\u00f6ping, Sweden. Operations Research (accepted)","DOI":"10.1007\/978-3-642-60744-8_15"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB11","doi-asserted-by":"crossref","unstructured":"LeBlanc, L., Chifflet, J., Mahey, P., 1998. Packet routing in telecommunication networks with path and flow restrictions. INFORMS Journal on Computing (to appear)","DOI":"10.1287\/ijoc.11.2.188"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB12","unstructured":"Magnanti, T., Wolsey, L., 1995. Optimal trees. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (Eds.), Network Models, Handbooks in Operations Research and Management Science, Vol. 7. North-Holland, Amsterdam"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB13","unstructured":"Manyem, P., Stallmann, M., 1996. Some Approximation Results in Multicasting. Working Paper, North Carolina State University"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB14","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.35.6.820","article-title":"Generating alternative mixed-integer programming models using variable redefinition","volume":"35","author":"Martin","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB15","unstructured":"Vo\u00df, S., 1999. The Steiner tree problem with hop constraints. In: Sharaiha, Y., Beasley, J. (Eds.), Advances in Combinatorial Optimization. Annals of Operations Research, vol. 86. pp. 271\u2013294"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0548(88)90033-0","article-title":"The design of centralized networks with reliability and availability constraints","volume":"15","author":"Woolston","year":"1988","journal-title":"Computer and Operations Research"},{"key":"10.1016\/S0377-2217(00)00143-0_BIB17","unstructured":"Yuan, D., 1997. Optimal Synthesis and Multicommodity Routing in Telecommunication Networks. PhD thesis, Division of Optimization, Department of Mathematics, Link\u00f6ping Institute of Technology, Link\u00f6ping, Sweden"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T19:30:10Z","timestamp":1580239810000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700001430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0377221700001430"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00143-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}