{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:04:48Z","timestamp":1778605488199,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,3]],"date-time":"2013-04-03T00:00:00Z","timestamp":1364947200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10589-013-9556-5","type":"journal-article","created":{"date-parts":[[2013,4,2]],"date-time":"2013-04-02T12:21:53Z","timestamp":1364905313000},"page":"405-438","source":"Crossref","is-referenced-by-count":28,"title":["Lower and upper bounds for the spanning tree with minimum branch vertices"],"prefix":"10.1007","volume":"56","author":[{"given":"Francesco","family":"Carrabs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Cerulli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manlio","family":"Gaudioso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monica","family":"Gentili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,3]]},"reference":[{"issue":"1","key":"9556_CR1","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.cor.2009.03.006","volume":"37","author":"I. Akg\u00fcn","year":"2010","unstructured":"Akg\u00fcn, I., Tansel, B.\u00c7.: Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints. Comput. Oper. Res. 37(1), 72\u201382 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9556_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.ejor.2011.01.051","volume":"212","author":"I. Akg\u00fcn","year":"2011","unstructured":"Akg\u00fcn, I., Tansel, B.\u00c7.: New formulations of the Hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints. Eur. J. Oper. Res. 212(2), 263\u2013276 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9556_CR3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1111\/j.1475-3995.2011.00830.x","volume":"19","author":"A.M. Almeida de","year":"2012","unstructured":"de Almeida, A.M., Martins, P., de Souza, M.C.: Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations. Int. Trans. Oper. Res. 19(3), 323\u2013352 (2012)","journal-title":"Int. Trans. Oper. Res."},{"key":"9556_CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7151\/dmgt.1053","volume":"17","author":"H. Broesma","year":"1997","unstructured":"Broesma, H., Li, X.: Spanning trees with many or few colors in edge-colored graphs. Discuss. Math., Graph Theory 17, 259\u2013269 (1997)","journal-title":"Discuss. Math., Graph Theory"},{"key":"9556_CR5","volume-title":"ICALP\u2019 02","author":"L. Gargano","year":"2002","unstructured":"Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: ICALP\u2019 02, Mal\u00e1ga, Spain (2002)"},{"key":"9556_CR6","isbn-type":"print","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/0-387-23529-9_7","volume-title":"The Next Wave on Computing, Optimization, and Decision Technologies","author":"R. Cerulli","year":"2005","unstructured":"Cerulli, R., Fink, A., Gentili, M., Voss, S.: Metaheuristics comparison for the minimum labelling spanning tree problem. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Next Wave on Computing, Optimization, and Decision Technologies, pp. 93\u2013106. Springer, New York (2005). ISBN:0-387-23528-0","ISBN":"https:\/\/id.crossref.org\/isbn\/0387235280"},{"key":"9556_CR7","first-page":"39","volume":"4","author":"R. Cerulli","year":"2006","unstructured":"Cerulli, R., Fink, A., Gentili, M., Voss, S.: Extensions of the minimum labelling spanning tree problem. J. Telecommun. Inf. Technol. 4, 39\u201345 (2006)","journal-title":"J. Telecommun. Inf. Technol."},{"key":"9556_CR8","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":"9556_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M. Desrochers","year":"1991","unstructured":"Desrochers, M., Laporte, G.: Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10, 27\u201336 (1991)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9556_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/moor.1050.0175","volume":"31","author":"M. Gaudioso","year":"2006","unstructured":"Gaudioso, M., Giallombardo, G., Miglionico, G.: An incremental method for solving convex finite min-max problems. Math. Oper. Res. 31(1), 173\u2013187 (2006)","journal-title":"Math. Oper. Res."},{"key":"9556_CR11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10589-007-9149-2","volume":"44","author":"M. Gaudioso","year":"2009","unstructured":"Gaudioso, M., Giallombardo, G., Miglionico, G.: On solving the Lagrangian dual of integer programs via an incremental approach. Comput. Optim. Appl. 44, 117\u2013138 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"9","key":"9556_CR12","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 with Hop constraints. Comput. Oper. Res. 22(9), 959\u2013970 (1995)","journal-title":"Comput. Oper. Res."},{"key":"9556_CR13","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P. Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A nearly best-possible algorithm for node-weighted Steiner trees. J. Algorithms 19, 104\u2013115 (1995)","journal-title":"J. Algorithms"},{"key":"9556_CR14","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0927-0507(05)80126-4","volume-title":"Network Models","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: 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, pp. 503\u2013615. North-Holland, Amsterdam (1995)"},{"key":"9556_CR15","volume-title":"Convex Analysis and Minimization Algorithms, vols. I\u2013II","author":"J.-P. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-P., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms, vols. I\u2013II. Springer, Berlin (1993)"},{"key":"9556_CR16","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications, Prentice Hall, New York (1993)"},{"key":"9556_CR17","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1999)"},{"key":"9556_CR18","volume-title":"Optical Communication Networks","author":"B. Mukherjee","year":"1997","unstructured":"Mukherjee, B.: Optical Communication Networks. McGraw-Hill, New York (1997)"},{"key":"9556_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/35.747251","volume":"37","author":"L.H. Sahasrabuddhe","year":"1999","unstructured":"Sahasrabuddhe, L.H., Mukherjee, B.: Light-trees: optical multicasting for improved performance in wavelength-routed networks. IEEE Commun. Mag. 37, 67\u201373 (1999)","journal-title":"IEEE Commun. Mag."},{"key":"9556_CR20","unstructured":"http:\/\/www.dipmat.unisa.it\/people\/carrabs\/www\/DataSet\/MBV_Instances.zip"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9556-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9556-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9556-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:37:34Z","timestamp":1559227054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9556-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,3]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9556"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9556-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,3]]}}}