11 citations · 22 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2023
New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer
The Multiobjective Minimum Spanning Tree (MO-MST) problem is a variant of the Minimum Spanning Tree problem, in which the costs associated with every edge of the input graph are ve…
cs.DM2021★ 11 cited
Targeted Multiobjective Dijkstra Algorithm
Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda +1
In this paper, we introduce the Targeted Multiobjective Dijkstra Algorithm (T-MDA), a label setting algorithm for the One-to-One Multiobjective Shortest Path (MOSP) Problem. The T-…