{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T18:08:06Z","timestamp":1770142086736,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T00:00:00Z","timestamp":1660348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T00:00:00Z","timestamp":1660348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","award":["RGNF fellowship ID- [RGNF-2014-15-SC-UTT-74975]"],"award-info":[{"award-number":["RGNF fellowship ID- [RGNF-2014-15-SC-UTT-74975]"]}],"id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades\u201dof Spain","award":["PGC2018-0953322-B-C21 and PID2021-125709OB-C21 MCIU\/AEI\/FEDER-UE."],"award-info":[{"award-number":["PGC2018-0953322-B-C21 and PID2021-125709OB-C21 MCIU\/AEI\/FEDER-UE."]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11590-022-01918-1","type":"journal-article","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T17:02:36Z","timestamp":1660410156000},"page":"2005-2031","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["General variable neighborhood search for the minimum stretch spanning tree problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Yogita Singh","family":"Kardam","sequence":"first","affiliation":[]},{"given":"Kamal","family":"Srivastava","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Mart\u00ed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,13]]},"reference":[{"key":"1918_CR1","doi-asserted-by":"publisher","DOI":"10.1201\/9780203497289","volume-title":"Spanning trees and optimization problems","author":"BY Wu","year":"2004","unstructured":"Wu, B.Y., Chao, K.M.: Spanning trees and optimization problems. CHAPMAN & HALL\/CRC, Washington (2004)"},{"issue":"22","key":"1918_CR2","doi-asserted-by":"publisher","first-page":"5050","DOI":"10.1016\/j.ins.2007.06.005","volume":"177","author":"G Chen","year":"2007","unstructured":"Chen, G., Chen, S., Guo, W., Chen, H.: The multi-criteria minimum spanning tree problem based genetic algorithm. Inf. Sci. 177(22), 5050\u20135063 (2007). https:\/\/doi.org\/10.1016\/j.ins.2007.06.005","journal-title":"Inf. Sci."},{"issue":"1","key":"1918_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-010-0973-2","volume":"27","author":"K Ozeki","year":"2011","unstructured":"Ozeki, K., Yamashita, T.: Spanning trees: a survey. Graphs Combin. 27(1), 1\u201326 (2011). https:\/\/doi.org\/10.1007\/s00373-010-0973-2","journal-title":"Graphs Combin."},{"key":"1918_CR4","unstructured":"Madkour, A., Aref, W.G., Rehman, F.U., Rahman, M.A., Basalamah, S.: A Survey of Shortest-Path Algorithms, arXiv preprint arXiv:1705.02044 (2017)"},{"issue":"9","key":"1918_CR5","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1016\/j.comgeo.2015.06.004","volume":"48","author":"P Brass","year":"2015","unstructured":"Brass, P., Vigan, I., Xu, N.: Shortest path planning for a tethered robot. Comput. Geom. 48(9), 732\u2013742 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2015.06.004","journal-title":"Comput. Geom."},{"key":"1918_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ins.2019.07.014","volume":"503","author":"C Cintrano","year":"2019","unstructured":"Cintrano, C., Chicano, F., Alba, E.: Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions. Inf. Sci. 503, 255\u2013273 (2019). https:\/\/doi.org\/10.1016\/j.ins.2019.07.014","journal-title":"Inf. Sci."},{"key":"1918_CR7","volume-title":"On shortest paths in VLSI design","author":"P Widmayer","year":"1990","unstructured":"Widmayer, P.: On shortest paths in VLSI design. Technical report, ACM digital library, Albert-Ludwigs University at Freiburg (1990)"},{"key":"1918_CR8","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT Press (2009)"},{"key":"1918_CR9","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.asoc.2017.10.022","volume":"62","author":"K Singh","year":"2018","unstructured":"Singh, K., Sundar, S.: Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t-spanner problem. Appl. Soft Comput. 62, 110\u2013118 (2018). https:\/\/doi.org\/10.1016\/j.asoc.2017.10.022","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"1918_CR10","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM 36(3), 510\u2013530 (1989). https:\/\/doi.org\/10.1145\/65950.65953","journal-title":"J. ACM"},{"issue":"3","key":"1918_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Opt. 5(3), 423\u2013454 (2017). https:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO J. Comput. Opt."},{"issue":"11","key":"1918_CR12","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997). https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Comput. Oper. Res."},{"key":"1918_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.cor.2013.11.008","volume":"52","author":"J S\u00e1nchez-Oro","year":"2014","unstructured":"S\u00e1nchez-Oro, J., Pantrigo, J.J., Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem. Comput. Oper. Res. 52, 209\u2013219 (2014). https:\/\/doi.org\/10.1016\/j.cor.2013.11.008","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1918_CR14","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s10589-017-9926-5","volume":"68","author":"J S\u00e1nchez-Oro","year":"2017","unstructured":"S\u00e1nchez-Oro, J., Gavara, A.M., Laguna, M., Mart\u00ed, R., Duarte, A.: Variable neighborhood scatter search for the incremental graph drawing problem. Comput. Optim. Appl. 68(3), 775\u2013797 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9926-5","journal-title":"Comput. Optim. Appl."},{"key":"1918_CR15","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2020.106651","volume":"214","author":"MA Rodr\u00edguez-Garc\u00eda","year":"2021","unstructured":"Rodr\u00edguez-Garc\u00eda, M.A., S\u00e1nchez-Oro, J., Rodriguez-Tello, E., Monfroy, E., Duarte, A.: Two-dimensional bandwidth minimization problem: exact and heuristic approaches. Knowl. Based Syst. 214, 106\u2013651 (2021). https:\/\/doi.org\/10.1016\/j.knosys.2020.106651","journal-title":"Knowl. Based Syst."},{"issue":"4","key":"1918_CR16","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput. 18(4), 740\u2013747 (1989). https:\/\/doi.org\/10.1137\/0218050","journal-title":"SIAM J. Comput."},{"issue":"5","key":"1918_CR17","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.dam.2007.07.001","volume":"156","author":"C Liebchen","year":"2008","unstructured":"Liebchen, C., W\u00fcnsch, G.: The zoo of tree spanner problems. Discret. Appl. Math. 156(5), 569\u2013587 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.07.001","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1918_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L Cai","year":"1995","unstructured":"Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Discret. Math. 8(3), 359\u2013387 (1995). https:\/\/doi.org\/10.1137\/S0895480192237403","journal-title":"SIAM J. Discret. Math."},{"issue":"7","key":"1918_CR19","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1007\/s11590-018-1340-0","volume":"13","author":"E \u00c1lvarez-Miranda","year":"2019","unstructured":"\u00c1lvarez-Miranda, E., Sinnl, M.: Mixed-integer programming approaches for the tree t-spanner problem. Optim. Lett. 13(7), 1693\u20131709 (2019). https:\/\/doi.org\/10.1007\/s11590-018-1340-0","journal-title":"Optim. Lett."},{"issue":"3","key":"1918_CR20","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.comgeo.2007.12.001","volume":"41","author":"O Cheong","year":"2008","unstructured":"Cheong, O., Haverkort, H., Lee, M.: Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. 41(3), 188\u2013205 (2008). https:\/\/doi.org\/10.1016\/j.comgeo.2007.12.001","journal-title":"Comput. Geom."},{"key":"1918_CR21","first-page":"1824","volume-title":"Proceedings of XLIII Simposio Brasileiro de Pesquisa Operacional (SBPO)","author":"MF de Mattos Gaiowski","year":"2011","unstructured":"de Mattos Gaiowski, M.F., de Souza, C.C.: Minimum dilation geometric spanning trees. In: Proceedings of XLIII Simposio Brasileiro de Pesquisa Operacional (SBPO), pp. 1824\u20131835. Ubatuba-SP, Brazil (2011)"},{"key":"1918_CR22","doi-asserted-by":"crossref","unstructured":"Brandt, A.F., Gaiowski, M.F.A.M., Rezende, P.J., Souza, C.C.: Computing Minimum Dilation Spanning Trees in Geometric Graphs, In: 21st International Conference on Computing and Combinatorics (COCOON), pp. 297\u2013309. Springer, Beijing, China (2015)","DOI":"10.1007\/978-3-319-21398-9_24"},{"key":"1918_CR23","unstructured":"Lin, L., Lin, Y.: The minimum stretch spanning tree problem for typical graphs, arXiv preprint arXiv:1712.03497 (2017)"},{"key":"1918_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125502","volume":"386","author":"L Lin","year":"2020","unstructured":"Lin, L., Lin, Y.: Optimality computation of the minimum stretch spanning tree problem. Appl. Math. Comput. 386, 125502 (2020). https:\/\/doi.org\/10.1016\/j.amc.2020.125502","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"1918_CR25","doi-asserted-by":"publisher","first-page":"2050004:1","DOI":"10.1142\/S0219265920500048","volume":"20","author":"L Lin","year":"2020","unstructured":"Lin, L., Lin, Y.: The minimum stretch spanning tree problem for hamming graphs and higher-dimensional grids. J. Interconnect. Netw. 20(1), 2050004:1-2050004:15 (2020). https:\/\/doi.org\/10.1142\/S0219265920500048","journal-title":"J. Interconnect. Netw."},{"key":"1918_CR26","unstructured":"Boksberger, P., Kuhn, F., Wattenhofer, R.: On the approximation of the minimum maximum stretch tree problem. Technical report 409, Department of Computer Science, ETH Zurich (2003)"},{"key":"1918_CR27","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-981-15-6876-3_12","volume-title":"Computational methods and data engineering (ICMDE)","author":"YS Kardam","year":"2021","unstructured":"Kardam, Y.S., Srivastava, K.: General variable neighborhood search for the minimum stretch spanning tree problem. In: Computational methods and data engineering (ICMDE), pp. 149\u2013164. Springer (2021). https:\/\/doi.org\/10.1007\/978-981-15-6876-3_12"},{"key":"1918_CR28","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/978-3-319-07124-4_19","volume-title":"Handbook of heuristics","author":"P Hansen","year":"2018","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Mart\u00ed, R., Pardalos, P., Resende, M. (eds.) Handbook of heuristics, pp. 759\u2013787. Springer (2018)"},{"key":"1918_CR29","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-07124-4_9","volume-title":"Handbook of heuristics","author":"A Duarte","year":"2018","unstructured":"Duarte, A., Oro, J.S., Mladenovi\u0107, N., Todosijevi\u0107, R.: Variable neighborhood descent. In: Mart\u00ed, R., Pardalos, P., Resende, M. (eds.) Handbook of heuristics, pp. 341\u2013367. Springer (2018)"},{"key":"1918_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07124-4","volume-title":"Handbook of heuristics","author":"R Mart\u00ed","year":"2018","unstructured":"Mart\u00ed, R., Resende, M., Pardalos, P.: Handbook of heuristics. Springer International Publishing (2018)"},{"key":"1918_CR31","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to graph theory. Prentice Hall (2001)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01918-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01918-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01918-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T11:04:41Z","timestamp":1698663881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01918-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,13]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1918"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01918-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,13]]},"assertion":[{"value":"20 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}