Abstract
The aim of this paper is to provide a dynamic programming formulation for the spanning tree problem (\(\mathcal {STP}\)), which allows several instances of the classical \(\mathcal {STP}\) to be addressed. The spanning tree structure is modelled with states and transition between states, defining a state-space. Several properties are shown and optimality conditions are given. Once the theoretical fundamentals of the proposed formulation are derived, the multi-objective spanning tree problem (\(\mathcal {MOSTP}\)) is addressed. This problem arises in the telecommunications and transportation sectors. In these contexts, handling different criteria simultaneously plays a crucial role. The scientific literature provides several works that focus on the bi-objective version of the considered problem, in which only two criteria are taken into account. To the best of our knowledge, no works provide optimal methods to address the \(\mathcal {MOSTP}\) with an arbitrary number \(l\) of objective functions. In this paper we extend the proposed dynamic programming formulation to model and solve the \(\mathcal {MOSTP}\) with \(l \ge 3\) criteria.
Similar content being viewed by others
References
Aigner, M., Ziegler, G.M.: Cayley’s formula for the number of trees. In: Proofs from THE BOOK, pp. 201–206. Springer, Berlin (2010)
Bazlamacc, C.F., Hindi, K.S.: Minimum-weight spanning tree algorithms: a survey and empirical study. Comput. Oper. Res. 28, 767–785 (2001)
Beasley, J.E.: An algorithm for the Steiner problem in graphs. Networks 14, 147–159 (1984)
Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73(2), 129–174 (1996)
Clímaco, J.C.N., Eugénia 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
Hamacher, H.W., Ruhe, G.: On spanning tree problems with multiple objec- tives. Ann. Oper. Res. 52, 209–230 (1994)
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–551 (2001)
Matsui, T.: A flexible algorithm for generating all the spanning trees in undirected graphs. Algorithmica 18, 530–544 (1997)
Ramos, R.M., Alonso, S., Sicilia, J., Gonzales, C.: The problem of the optimal biobjective spanning tree. Eur. J. Oper. Res. 111, 617–628 (1998)
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)
Steiner, S., Radzik, T.: Computing all efficient solutions of the biobjective minimum spanning tree problem. Comput. Oper. Res. 35, 198–211 (2008)
Zhou, G., Gen, M.: Genetic algorithm approach on multi-criteria minimum spanning tree problem. Eur. J. Oper. Res. 114, 141–152 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Di Puglia Pugliese, L., Guerriero, F. & Santos, J.L. Dynamic programming for spanning tree problems: application to the multi-objective case. Optim Lett 9, 437–450 (2015). https://doi.org/10.1007/s11590-014-0759-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-014-0759-1