On spanning tree problems with multiple objectives

DOI10.1007/BF02032304zbMath0821.90126MaRDI QIDQ1339178

Horst W. Hamacher, Günter Ruhe

Publication date: 1 December 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

ranking; NP-complete; exact algorithm; approximation scheme; multiple-objective minimum spanning tree; network with vectorial weights

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C29: Multi-objective and goal programming

Related Items

Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., A preference-based approach to spanning trees and shortest paths problems, Minimum spanning trees made easier via multi-objective optimization, Randomized local search, evolutionary algorithms, and the minimum spanning tree problem, A GRASP algorithm for the multi-criteria minimum spanning tree problem, Two-phase Pareto local search for the biobjective traveling salesman problem, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, Optimality conditions in preference-based spanning tree problems, Combinatorial optimization in system configuration design, Connectedness of efficient solutions in multiple criteria combinatorial optimization, Geometric methods to solve max-ordering location problems, On bicriterion minimal spanning trees: An approximation, The problem of the optimal biobjective spanning tree, Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach, Multiobjective routing problems, A decision-theoretic approach to robust optimization in multivalued graphs, Computing all efficient solutions of the biobjective minimum spanning tree problem, A survey of recent developments in multiobjective optimization, On local optima in multiobjective combinatorial optimization problems, Choquet-based optimisation in multiobjective shortest path and spanning tree problems, On matroids with multiple objectives, Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems, A Survey on Multiple Objective Minimum Spanning Tree Problems, Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Efficient spanning trees
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
• Note on combinatorial optimization with max-linear objective functions
• Proper efficiency and the theory of vector maximization
• Multi-Terminal Network Flows
• An Algorithm for Finding K Minimum Spanning Trees
• Two Algorithms for Generating Weighted Spanning Trees in Order
• The Traveling-Salesman Problem and Minimum Spanning Trees