{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:43:01Z","timestamp":1760708581649},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,6,19]],"date-time":"2013-06-19T00:00:00Z","timestamp":1371600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s11590-013-0665-y","type":"journal-article","created":{"date-parts":[[2013,6,18]],"date-time":"2013-06-18T04:58:57Z","timestamp":1371531537000},"page":"1225-1243","source":"Crossref","is-referenced-by-count":17,"title":["An edge-swap heuristic for generating spanning trees with minimum number of branch vertices"],"prefix":"10.1007","volume":"8","author":[{"given":"Ricardo M. A.","family":"Silva","sequence":"first","affiliation":[]},{"given":"Diego M.","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"Geraldo R.","family":"Mateus","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 F.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Festa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,19]]},"reference":[{"key":"665_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"JE Beasley","year":"1989","unstructured":"Beasley, J.E.: An SST-based algorithm for the Steiner problem in graphs. Networks 19, 1\u201316 (1989)","journal-title":"Networks"},{"key":"665_CR2","unstructured":"Carrabs, F., Cerulli, R., Gaudioso, M., Gentili, M.: Lower and upper bounds for the spanning tree with minimum branch vertices. Technical Report 3, Department of Mathematics and Computer Science, University of Salerno. Salerno, Italy (2009)"},{"key":"665_CR3","unstructured":"Cerulli, R.: Personal, communication. January (2010)"},{"key":"665_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10589-007-9120-2","volume":"42","author":"R Cerulli","year":"2009","unstructured":"Cerulli, R., Gentili, M., Iossa, A.: Bounded-degree spanning tree problems: models and new algorithms. Comput. Optim. Appl. 42, 353\u2013370 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"665_CR5","doi-asserted-by":"crossref","unstructured":"Cherkassky, B.V., Goldberg, A.V.: Negative-cycle detection algorithms. Technical Report 96\u2013029NEC Research Institute, Inc., Princeton, NJ (1996)","DOI":"10.1007\/3-540-61680-2_67"},{"key":"665_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"665_CR7","doi-asserted-by":"crossref","unstructured":"Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In 29th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 2380, pp. 355\u2013365. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45465-9_31"},{"key":"665_CR8","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D Klingman","year":"1974","unstructured":"Klingman, D., Napier, A., Stutz, J.: NETGEN\u2014a program for generating large scale (un)capacitated assignment, transportation, and minimum cost flow network problems. Manage. Sci. 20, 814\u2013821 (1974)","journal-title":"Manage. Sci."},{"issue":"1","key":"665_CR9","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"issue":"6","key":"665_CR10","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph colouring algorithm for large scheduling problems. J. Res. Natl. Bureau Standards. 84(6), 489\u2013503 (1979)","journal-title":"J. Res. Natl. Bureau Standards."},{"issue":"1","key":"665_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"665_CR12","volume-title":"C++ Standard Template Library","author":"PJ Plauger","year":"2000","unstructured":"Plauger, P.J., Lee, M., Musser, D., Stepanov, A.A.: C++ Standard Template Library. Prentice Hall PTR, Englewood Cliffs (2000)"},{"issue":"4","key":"665_CR13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"665_CR14","unstructured":"Reinelt, G.: TSPLIB 95 documentation. University of Heidelberg, Technical report (1995)"},{"key":"665_CR15","unstructured":"Silva, D.M.: Abordagem de refinamento iterativo para o problema da \u00e1rvore geradora com n\u00famero m\u00ednimo de v\u00e9rtices branch. Master\u2019s thesis, U. Federal de Minas Gerais, Belo Horizonte (MG). Brazil (2011)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0665-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0665-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0665-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T15:24:15Z","timestamp":1563204255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0665-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,19]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["665"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0665-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,19]]}}}