{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:23:35Z","timestamp":1770326615191,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T00:00:00Z","timestamp":1402444800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11590-014-0759-1","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T23:40:33Z","timestamp":1402443633000},"page":"437-450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic programming for spanning tree problems: application to the multi-objective case"],"prefix":"10.1007","volume":"9","author":[{"given":"Luigi","family":"Di Puglia Pugliese","sequence":"first","affiliation":[]},{"given":"Francesca","family":"Guerriero","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Luis","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,11]]},"reference":[{"key":"759_CR1","doi-asserted-by":"crossref","unstructured":"Aigner, M., Ziegler, G.M.: Cayley\u2019s formula for the number of trees. In: Proofs from THE BOOK, pp. 201\u2013206. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-00856-6_30"},{"key":"759_CR2","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/S0305-0548(00)00007-1","volume":"28","author":"CF Bazlamacc","year":"2001","unstructured":"Bazlamacc, C.F., Hindi, K.S.: Minimum-weight spanning tree algorithms: a survey and empirical study. Comput. Oper. Res. 28, 767\u2013785 (2001)","journal-title":"Comput. Oper. Res."},{"key":"759_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","volume":"14","author":"JE Beasley","year":"1984","unstructured":"Beasley, J.E.: An algorithm for the Steiner problem in graphs. Networks 14, 147\u2013159 (1984)","journal-title":"Networks"},{"issue":"2","key":"759_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73(2), 129\u2013174 (1996)","journal-title":"Math. Program."},{"key":"759_CR5","doi-asserted-by":"crossref","unstructured":"Cl\u00edmaco, J.C.N., Eug\u00e9nia Captivo, M., Pascoal, M.M.B.: On the bicriterion minimal cost\/minimal label spanning tree problem. Eur. J. Oper. Res. (2009). doi: 10.1016\/j.ejor.2009.10.013","DOI":"10.1016\/j.ejor.2009.10.013"},{"key":"759_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02032304","volume":"52","author":"HW Hamacher","year":"1994","unstructured":"Hamacher, H.W., Ruhe, G.: On spanning tree problems with multiple objec- tives. Ann. Oper. Res. 52, 209\u2013230 (1994)","journal-title":"Ann. Oper. Res."},{"key":"759_CR7","doi-asserted-by":"crossref","unstructured":"Knowles, J.D., Corne, D.W.: A comparison of encodings and algorithms for multiobjective spanning tree problems. In: Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pp. 544\u2013551 (2001)","DOI":"10.1109\/CEC.2001.934439"},{"key":"759_CR8","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/PL00009171","volume":"18","author":"T Matsui","year":"1997","unstructured":"Matsui, T.: A flexible algorithm for generating all the spanning trees in undirected graphs. Algorithmica 18, 530\u2013544 (1997)","journal-title":"Algorithmica"},{"key":"759_CR9","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/S0377-2217(97)00391-3","volume":"111","author":"RM Ramos","year":"1998","unstructured":"Ramos, R.M., Alonso, S., Sicilia, J., Gonzales, C.: The problem of the optimal biobjective spanning tree. Eur. J. Oper. Res. 111, 617\u2013628 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"759_CR10","unstructured":"Sourd, F., Spanjaard, O., Perny, P.: Multi-objective branch-and-bound. application to the bi-objective spanning tree problem. In: MOPGP06: 7th Int. Conf. on Multi-Objective Programming and Goal Programming (2006)"},{"key":"759_CR11","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.cor.2006.02.023","volume":"35","author":"S Steiner","year":"2008","unstructured":"Steiner, S., Radzik, T.: Computing all efficient solutions of the biobjective minimum spanning tree problem. Comput. Oper. Res. 35, 198\u2013211 (2008)","journal-title":"Comput. Oper. Res."},{"key":"759_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0377-2217(98)00016-2","volume":"114","author":"G Zhou","year":"1999","unstructured":"Zhou, G., Gen, M.: Genetic algorithm approach on multi-criteria minimum spanning tree problem. Eur. J. Oper. Res. 114, 141\u2013152 (1999)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0759-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0759-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0759-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:16:46Z","timestamp":1746263806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0759-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,11]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["759"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0759-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,11]]}}}