A new approach for the multiobjective minimum spanning tree
DOI10.1016/j.cor.2018.05.007zbMath1391.90618OpenAlexW2807218612WikidataQ129802465 ScholiaQ129802465MaRDI QIDQ1651644
Francesca Guerriero, Luigi Di Puglia Pugliese, José Luis Santos
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.05.007
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Efficient spanning trees
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
- On the complexity of finding multi-constrained spanning trees
- Euclidean minimum spanning trees and bichromatic closest pairs
- On spanning tree problems with multiple objectives
- On bicriterion minimal spanning trees: An approximation
- Arborescence optimization problems solvable by Edmonds' algorithm
- On the minimum label spanning tree problem
- The problem of the optimal biobjective spanning tree
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- The origins of minimal spanning tree algorithms -- Borůvka and Jarník
- Dynamic programming for spanning tree problems: application to the multi-objective case
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Near-optimal fully-dynamic graph connectivity
- An optimal minimum spanning tree algorithm
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- On Finding and Updating Spanning Trees and Shortest Paths
- Two Algorithms for Generating Weighted Spanning Trees in Order
- The Complexity of Multiterminal Cuts
- A randomized linear-time algorithm to find minimum spanning trees
- Spanning Trees and Optimization Problems
- On the History of the Minimum Spanning Tree Problem
- Spanning Trees—Short or Small
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Fibonacci heaps and their uses in improved network optimization algorithms
- Multicriteria Optimization
- Matroids and the greedy algorithm
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Minimum-weight spanning tree algorithms. A survey and empirical study
- Label correcting methods to solve multicriteria shortest path problems
This page was built for publication: A new approach for the multiobjective minimum spanning tree