{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T13:03:49Z","timestamp":1769691829314,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T00:00:00Z","timestamp":1263254400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s10732-009-9123-5","type":"journal-article","created":{"date-parts":[[2010,1,11]],"date-time":"2010-01-11T17:05:09Z","timestamp":1263229509000},"page":"23-37","source":"Crossref","is-referenced-by-count":8,"title":["Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Ana","family":"Paias","sequence":"additional","affiliation":[]},{"given":"Dushyant","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,12]]},"reference":[{"key":"9123_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R. Ahuja","year":"2002","unstructured":"Ahuja, R., Ergun, O., Orlin, J., Punnen, A.: A survey of very large scale neighborhood search techniques. Discrete Appl. Math. 123, 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9123_CR2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ejor.2007.06.012","volume":"190","author":"J.-F. Cordeau","year":"2008","unstructured":"Cordeau, J.-F., Costa, A.M., Laport, G.: Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. Eur. J. Oper. Res. 190, 68\u201378 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9123_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0167-6377(98)00029-7","volume":"23","author":"G. Dahl","year":"1998","unstructured":"Dahl, G.: The 2-hop spanning tree problem. Oper. Res. Lett. 23, 21\u201326 (1998)","journal-title":"Oper. Res. Lett."},{"key":"9123_CR4","unstructured":"Dahl, G., Flatberg, T., Foldnes, N., Gouveia, L.: The jump formulation for the hop-constrained minimum spanning tree problem. Working Paper no5, C.I.O. (2004)"},{"key":"9123_CR5","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/978-0-387-30165-5_19","volume-title":"Handbooks of Telecommunications","author":"G. Dahl","year":"2006","unstructured":"Dahl, G., Gouveia, L., Requejo, C.: On formulations and methods for the hop-constrained minimum spanning tree problem. In: Pardalos, P., Resende, M. (eds.) Handbooks of Telecommunications, pp. 493\u2013515. Springer, Berlin (2006)"},{"key":"9123_CR6","first-page":"16","volume":"4\/2007","author":"M. Fernandes","year":"2007","unstructured":"Fernandes, M., Gouveia, L., Voss, S.: Determining hop-constrained heuristics with repetitive heuristics. J.\u00a0Telecommun. Inf. Technol. (JTIT) 4\/2007, 16\u201322 (2007)","journal-title":"J.\u00a0Telecommun. Inf. Technol. (JTIT)"},{"key":"9123_CR7","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0305-0548(94)00074-I","volume":"22","author":"L. Gouveia","year":"1995","unstructured":"Gouveia, L.: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. Comput. Oper. Res. 22, 959\u2013970 (1995)","journal-title":"Comput. Oper. Res."},{"key":"9123_CR8","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","volume":"95","author":"L. Gouveia","year":"1996","unstructured":"Gouveia, L.: Multicommodity flow models for spanning trees with hop constraints. Eur. J. Oper. Res. 95, 178\u2013190 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9123_CR9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","volume":"10","author":"L. Gouveia","year":"1998","unstructured":"Gouveia, L.: Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints. INFORMS J. Comput. 10, 180\u2013188 (1998)","journal-title":"INFORMS J. Comput."},{"key":"9123_CR10","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0377-2217(00)00143-0","volume":"132","author":"L. Gouveia","year":"2001","unstructured":"Gouveia, L., Requejo, C.: A new Lagrangian relaxation approach for the hop-constrained minimum spanning tree problem. Eur. J. Oper. Res. 132, 539\u2013552 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9123_CR11","unstructured":"Gouveia, L., Simonetti, L., Uchoa, E.: Modelling the hop-constrained minimum spanning tree problem over a layered graph. In: Proceedings of the INOC 2007 Conference, Spa, 2007"},{"key":"9123_CR12","unstructured":"Gruber, M., Raidl, G.R.: Variable neighborhood search for the bounded diameter minimum spanning tree problem. In: Proceedings of 18th Mini Euro Conference on Variable Neighborhood Search, Tenerife, Spain (2005)"},{"key":"9123_CR13","doi-asserted-by":"crossref","unstructured":"Gruber, M., van Hemert, J., Raidl, G.R.: Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA and ACO. In: Proceedings of GECCO\u201906, Seattle Washington (2006)","DOI":"10.1145\/1143997.1144185"},{"key":"9123_CR14","unstructured":"Manyem, P., Stallmann, M.: Some approximation results in multicasting. Working paper, North Carolina State University (1996)"},{"key":"9123_CR15","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10107-003-0497-0","volume":"101","author":"J. Orlin","year":"2005","unstructured":"Orlin, J., Sharma, D.: Extended neighborhood: definition and characterization. Math. Program. 101, 537\u2013559 (2005)","journal-title":"Math. Program."},{"key":"9123_CR16","unstructured":"Potts, C., van\u00a0de Velde, S.: Dynasearch\u2014iterative local improvement by dynamic programming\u2014Orat 1: the traveling salesman problem. Technical Report, University of Twente (1995)"},{"key":"9123_CR17","unstructured":"Vo\u00df, S.: The Steiner tree problem with hop constraints. In: Sharaiha, Y., Beasley, J. (eds.) Advances in Combinatorial Optimization Annals of Operations Research, vol. 86, pp. 321\u2013345 (1999)"},{"key":"9123_CR18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0548(88)90033-0","volume":"15","author":"K. Woolston","year":"1988","unstructured":"Woolston, K., Albin, S.: The design of centralized networks with reliability and availability constraints. Comput. Oper. Res. 15, 207\u2013217 (1988)","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-009-9123-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-009-9123-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-009-9123-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:30Z","timestamp":1559256870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-009-9123-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,12]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["9123"],"URL":"https:\/\/doi.org\/10.1007\/s10732-009-9123-5","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,12]]}}}