Abstract
A classical approach to multicriteria problems asks for the optimization of a suitable linear combination of the objectives. In this work we address such problems when one of the objectives is the linear function, the other is a non-linear one and we seek for a spanning tree of a given graph which optimizes the combination of the two functions. We consider both maximization and minimization problems and present the complexity status of 56 such problems, giving, whenever possible, polynomial solution algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.M. Camerini, “The min-max spanning tree problem and some extensions,” Inform. Process. Lett., vol. 7, pp. 10–14, 1978.
P.M. Camerini, G. Galbiati, and F. Maffioli, “Complexity of spanning tree problems: Part I,” European J. Oper. Res., vol. 5, pp. 346–352, 1980.
P.M. Camerini, G. Galbiati, and F. Maffioli, “On the complexity of finding multi-constrained spanning trees,” Discr. Appl. Math., vol. 5, pp. 39–50, 1983.
P.M. Camerini, G. Galbiati, and F. Maffioli, “The complexity of weighted multi-constrained spanning tree problems,” in Theory of Algorithms, Lovász and Szemerédi (Eds.), North-Holland, 1985, pp. 53–102. Colloquia Math. Soc. J. Bolyai, vol. 44.
M. Dell'Amico and F. Maffioli, “On some multicriteria arborescence problems: complexity and algorithms,” Discr. Appl. Math., vol. 65, pp. 191–206, 1996.
M. Dell'Amico, M. Labbé, and F. Maffioli, “Complexity of spanning tree problems with leaf-dependent objective function,” Networks, vol. 27, pp. 175–181, 1996.
E. Dijkstra, “A note on two problems in connection with graphs,” Numer. Math., vol. 1, pp. 269–271, 1959.
M. Fischetti, G. Laporte, and S. Martello, “The delivery man problem and cumulative matroids,” Operations Research, vol. 41, pp. 1055–1064, 1993.
M.R. Garey and D.S. Johnson, Computers and Intractability, Freeman & Co.: San Francisco, 1979.
M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Werlag: Berlin, 1988.
E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Reinehart and Winston, 1976.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dell'Amico, M., Maffioli, F. Combining Linear and Non-Linear Objectives in Spanning Tree Problems. Journal of Combinatorial Optimization 4, 253–269 (2000). https://doi.org/10.1023/A:1009854922371
Issue Date:
DOI: https://doi.org/10.1023/A:1009854922371