2018
DOI: 10.1016/j.cor.2018.05.007
|View full text |Cite
|
Sign up to set email alerts
|

A new approach for the multiobjective minimum spanning tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(17 citation statements)
references
References 35 publications
0
17
0
Order By: Relevance
“…In this context, two publications by Di Puglia Pugliese, Guerreiro, and Santos stand out. They first published a dynamic programming algorithm for the MO-MST problem in [Di Puglia Pugliese et al, 2014] and afterwards they notably improved their approach in [Santos et al, 2018] designing the BN algorithm. In it they include an elegant way of ensuring that every dynamically built tree is only considered once.…”
Section: Literature Review and Outlinementioning
confidence: 99%
See 2 more Smart Citations
“…In this context, two publications by Di Puglia Pugliese, Guerreiro, and Santos stand out. They first published a dynamic programming algorithm for the MO-MST problem in [Di Puglia Pugliese et al, 2014] and afterwards they notably improved their approach in [Santos et al, 2018] designing the BN algorithm. In it they include an elegant way of ensuring that every dynamically built tree is only considered once.…”
Section: Literature Review and Outlinementioning
confidence: 99%
“…Since on bidimensional MO-MST instances both algorithms are clearly outperformed by the two phase algorithm from Sourd and Spanjaard [2008], we use three and four dimensional instances in our experiments. We consider all such MO-MST instances from [Santos et al, 2018] and a big subset of the instances used in [Fernandes et al, 2020]. Thereby, we achieve the last contribution in this paper: to the best of our knowledge the size of the solved instances is bigger than so far in the literature.…”
Section: Literature Review and Outlinementioning
confidence: 99%
See 1 more Smart Citation
“…Among these, we cite the genetic algorithms by Azaron et al (2009) and Konak and Smith (2011). We also mention the recent label setting algorithm by Santos et al (2018), which deals with multiple objectives and could be adapted to take care of reliability.…”
Section: Brief Literature Reviewmentioning
confidence: 99%
“…Sadly, the work omits some implementation details in the algorithmic description for making it reproducible. A recent approach by Santos et al (2018) transforms the original network into a directed network in which paths trees for the original network match paths in the transformed one. The authors then apply a labelling algorithm for finding multi-objective shortest path to solve moMST instances for arbitrary objectives.…”
Section: Introductionmentioning
confidence: 99%