Empirical study of exact algorithms for the multi-objective spanning tree

I. F. C. Fernandes (), E. F. G. Goldbarg (), S. M. D. M. Maia () and M. C. Goldbarg ()
Additional contact information
I. F. C. Fernandes: Universidade Federal do Rio Grande do Norte
E. F. G. Goldbarg: Universidade Federal do Rio Grande do Norte
S. M. D. M. Maia: Universidade Federal do Rio Grande do Norte
M. C. Goldbarg: Universidade Federal do Rio Grande do Norte

Computational Optimization and Applications, 2020, vol. 75, issue 2, No 10, 605 pages

Abstract: Abstract The multi-objective spanning tree (MoST) is an extension of the minimum spanning tree problem (MST) that, as well as its single-objective counterpart, arises in several practical applications. However, unlike the MST, for which there are polynomial-time algorithms that solve it, the MoST is NP-hard. Several researchers proposed techniques to solve the MoST, each of those methods with specific potentialities and limitations. In this study, we examine those methods and divide them into two categories regarding their outcomes: Pareto optimal sets and Pareto optimal fronts. To compare the techniques from the two groups, we investigated their behavior on 2, 3 and 4-objective instances from different classes. We report the results of a computational experiment on 8100 complete and grid graphs in which we analyze specific features of each algorithm as well as the computational effort required to solve the instances.

Keywords: Spanning tree; Multi-objective problems; Exact algorithms (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-019-00154-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:75:y:2020:i:2:d:10.1007_s10589-019-00154-1

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-019-00154-1

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().