{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:04:55Z","timestamp":1778605495179,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T00:00:00Z","timestamp":1534809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico (BR)","award":["870038\/2002-8"],"award-info":[{"award-number":["870038\/2002-8"]}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["305889\/2015-0"],"award-info":[{"award-number":["305889\/2015-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["301254\/2015-0"],"award-info":[{"award-number":["301254\/2015-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10589-018-0027-x","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T11:40:39Z","timestamp":1534851639000},"page":"829-855","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An exact and heuristic approach for the d-minimum branch vertices problem"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4326-3949","authenticated-orcid":false,"given":"Jorge","family":"Moreno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Frota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cor.2009.03.006","volume":"37","author":"\u0130 Akg\u00fcn","year":"2010","unstructured":"Akg\u00fcn, \u0130., Tansel, B.\u00c7.: Min-degree constrained minimum spanning tree problem: new formulation via Miller\u2013Tucker\u2013Zemlin constraints. Comput. Oper. Res. 37(1), 72\u201382 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10878-014-9756-7","volume":"31","author":"L Bastos","year":"2016","unstructured":"Bastos, L., Ochi, L.S., Protti, F., Subramanian, A., Martins, I., Pinheiro, R.G.S.: Efficient algorithms for cluster editing. J. Comb. Optim. 31(1), 347\u2013371 (2016)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"27_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10589-013-9556-5","volume":"56","author":"F Carrabs","year":"2013","unstructured":"Carrabs, F., Cerulli, R., Gaudioso, M., Gentili, M.: Lower and upper bounds for the spanning tree with minimum branch vertices. Comput. Optim. Appl. 56(2), 405\u2013438 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","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(3), 353\u2013370 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2015.09.047","volume":"250","author":"VN Coelho","year":"2016","unstructured":"Coelho, V.N., Grasas, A., Ramalhinho, H., Coelho, I.M., Souza, M.J.F., Cruz, R.C.: An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints. Eur. J. Oper. Res. 250(2), 367\u2013376 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR6","volume-title":"Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol. 2380.","author":"L Gargano","year":"2002","unstructured":"Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol. 2380. Springer, Berlin, Heidelberg (2002)"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s10589-017-9924-7","volume":"68","author":"M Landete","year":"2017","unstructured":"Landete, M., Mar\u00edn, A., Sainz-Pardo, J.L.: Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. Comput. Optim. Appl. 68(3), 749\u2013773 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","volume-title":"Handbook of Metaheuristics","author":"Helena R. Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146. Springer, Boston, MA (2010)"},{"issue":"3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.ejor.2015.04.011","volume":"245","author":"A Mar\u00edn","year":"2015","unstructured":"Mar\u00edn, A.: Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem. Eur. J. Oper. Res. 245(3), 680\u2013689 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.dam.2011.08.008","volume":"163","author":"LC Martinez","year":"2014","unstructured":"Martinez, L.C., Da Cunha, A.S.: The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm. Discret. Appl. Math. 163, 210\u2013224 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/s10589-016-9850-0","volume":"65","author":"RA Melo","year":"2016","unstructured":"Melo, R.A., Samer, P., Urrutia, S.: An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. Comput. Optim. Appl. 65(3), 821\u2013844 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"27_CR12","unstructured":"Merabet, M., Molnar, M.: Generalization of the Minimum Branch Vertices Spanning Tree Problem. PhD thesis, Nanyang Technological University, Singapore (2016)"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) 7(4), 326\u2013329 (1960)","journal-title":"J. ACM (JACM)"},{"issue":"7","key":"27_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ipl.2013.01.016","volume":"113","author":"JM Schmidt","year":"2013","unstructured":"Schmidt, J.M.: A simple test on 2-vertex-and 2-edge-connectivity. Inf. Process. Lett. 113(7), 241\u2013244 (2013)","journal-title":"Inf. Process. Lett."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-20662-7_36","volume-title":"Experimental Algorithms","author":"Diego M. Silva","year":"2011","unstructured":"Silva, D.M., Silva, R.M.A., Mateus, G.R., Gon\u00e7alves, J.F., Resende, M.G.C., Festa, P.: An iterative refinement algorithm for the minimum branch vertices problem. In: International Symposium on Experimental Algorithms, pp. 421\u2013433. Springer, Heidelberg (2011)"},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s11590-013-0665-y","volume":"8","author":"RMA Silva","year":"2014","unstructured":"Silva, R.M.A., Silva, D.M., Mateus, G.R., Gon\u00e7alves, J.F., Resende, M.G.C., Festa, P.: An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. Optim. Lett. 8(4), 1225\u20131243 (2014)","journal-title":"Optim. Lett."},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.cor.2016.11.010","volume":"81","author":"S Silvestri","year":"2017","unstructured":"Silvestri, S., Laporte, G., Cerulli, R.: A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. Comput. Oper. Res. 81, 322\u2013332 (2017)","journal-title":"Comput. Oper. Res."},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.ins.2012.01.037","volume":"195","author":"S Sundar","year":"2015","unstructured":"Sundar, S., Singh, A., Rossi, A.: New heuristics for two bounded-degree spanning tree problems. Inf. Sci. 195, 226\u2013240 (2015)","journal-title":"Inf. Sci."},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/9598041","volume":"1","author":"JV Vilar","year":"2016","unstructured":"Vilar, J.V., Arroyo, J.E.C.: ILS Heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness. J. Appl. Math. 1(1), 1\u201315 (2016)","journal-title":"J. Appl. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0027-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0027-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0027-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T13:38:17Z","timestamp":1569073097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0027-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,21]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["27"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0027-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,21]]},"assertion":[{"value":"12 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}