{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:31Z","timestamp":1773656071502,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1023\/a:1009854922371","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"253-269","source":"Crossref","is-referenced-by-count":7,"title":["Combining Linear and Non-Linear Objectives in Spanning Tree Problems"],"prefix":"10.1007","volume":"4","author":[{"given":"Mauro","family":"Dell'Amico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"264577_CR1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","volume":"7","author":"P.M. Camerini","year":"1978","unstructured":"P.M. Camerini, \u201cThe min-max spanning tree problem and some extensions,\u201d Inform. Process. Lett., vol. 7, pp. 10\u201314, 1978.","journal-title":"Inform. Process. Lett."},{"key":"264577_CR2","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","volume":"5","author":"P.M. Camerini","year":"1980","unstructured":"P.M. Camerini, G. Galbiati, and F. Maffioli, \u201cComplexity of spanning tree problems: Part I,\u201d European J. Oper. Res., vol. 5, pp. 346\u2013352, 1980.","journal-title":"European J. Oper. Res."},{"key":"264577_CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(83)90014-8","volume":"5","author":"P.M. Camerini","year":"1983","unstructured":"P.M. Camerini, G. Galbiati, and F. Maffioli, \u201cOn the complexity of finding multi-constrained spanning trees,\u201d Discr. Appl. Math., vol. 5, pp. 39\u201350, 1983.","journal-title":"Discr. Appl. Math."},{"key":"264577_CR4","unstructured":"P.M. Camerini, G. Galbiati, and F. Maffioli, \u201cThe complexity of weighted multi-constrained spanning tree problems,\u201d in Theory of Algorithms, Lov\u00e1sz and Szemer\u00e9di (Eds.), North-Holland, 1985, pp. 53\u2013102. Colloquia Math. Soc. J. Bolyai, vol. 44."},{"key":"264577_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(95)00035-P","volume":"65","author":"M. Dell'Amico","year":"1996","unstructured":"M. Dell'Amico and F. Maffioli, \u201cOn some multicriteria arborescence problems: complexity and algorithms,\u201d Discr. Appl. Math., vol. 65, pp. 191\u2013206, 1996.","journal-title":"Discr. Appl. Math."},{"key":"264577_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<175::AID-NET2>3.0.CO;2-F","volume":"27","author":"M. Dell'Amico","year":"1996","unstructured":"M. Dell'Amico, M. Labb\u00e9, and F. Maffioli, \u201cComplexity of spanning tree problems with leaf-dependent objective function,\u201d Networks, vol. 27, pp. 175\u2013181, 1996.","journal-title":"Networks"},{"key":"264577_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"E. Dijkstra, \u201cA note on two problems in connection with graphs,\u201d Numer. Math., vol. 1, pp. 269\u2013271, 1959.","journal-title":"Numer. Math."},{"key":"264577_CR8","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","volume":"41","author":"M. Fischetti","year":"1993","unstructured":"M. Fischetti, G. Laporte, and S. Martello, \u201cThe delivery man problem and cumulative matroids,\u201d Operations Research, vol. 41, pp. 1055\u20131064, 1993.","journal-title":"Operations Research"},{"key":"264577_CR9","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability, Freeman & Co.: San Francisco, 1979."},{"key":"264577_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Werlag: Berlin, 1988."},{"key":"264577_CR11","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Reinehart and Winston, 1976."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009854922371.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009854922371\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009854922371.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:11:23Z","timestamp":1751281883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009854922371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["264577"],"URL":"https:\/\/doi.org\/10.1023\/a:1009854922371","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}