On spanning tree problems with multiple objectives
type: Item
instance of: scholarly article
title: On spanning tree problems with multiple objectives
zbMATH Open document ID: 0821.90126
DOI: 10.1007/BF02032304
author: Günter Ruhe
author: Horst W. Hamacher
published in: Annals of Operations Research
publication date: 1994-12-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 698939
zbMATH Keywords: multiple-objective minimum spanning tree
zbMATH Keywords: network with vectorial weights
zbMATH Keywords: NP-complete
zbMATH Keywords: exact algorithm
zbMATH Keywords: ranking
zbMATH Keywords: approximation scheme
MaRDI profile type: Publication
cites work: Q3056948
cites work: Q3745296
cites work: Note on combinatorial optimization with max-linear objective functions
cites work: Efficient spanning trees
cites work: Two Algorithms for Generating Weighted Spanning Trees in Order
cites work: Proper efficiency and the theory of vector maximization
cites work: An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
cites work: Multi-Terminal Network Flows
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: An Algorithm for Finding K Minimum Spanning Trees
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
description: scientific article; zbMATH DE number 698939