A Survey on Multiple Objective Minimum Spanning Tree Problems

DOI10.1007/978-3-642-02094-0_6zbMath1248.68388OpenAlexW1567525874MaRDI QIDQ3637314

Horst W. Hamacher, Stefan Ruzika

Publication date: 9 July 2009

Published in: Algorithmics of Large and Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02094-0_6

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

A multi-agent transgenetic algorithm for the bi-objective spanning tree problem ⋮ A new approach for the multiobjective minimum spanning tree ⋮ Exact algorithms for bi-objective ring tree problems with reliability measures ⋮ Biobjective optimization problems on matroids with binary costs ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Finding multi-objective supported efficient spanning trees ⋮ Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs ⋮ Empirical study of exact algorithms for the multi-objective spanning tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectedness of efficient solutions in multiple objective combinatorial optimization
• A preference-based approach to spanning trees and shortest paths problems
• Efficient spanning trees
• Minimum deviation and balanced optimization: A unified approach
• Minimum deviation problems
• A computational investigation of linear parametrization of criteria in multicriteria discrete programming
• An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• On combined minmax-minsum optimization
• On spanning tree problems with multiple objectives
• On bicriterion minimal spanning trees: An approximation
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Investigation of a linear convolution of criteria in multicriterial discrete programming
• A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
• Numerical analysis of tricriteria tree and assignment problems
• Combining linear and nonlinear objectives in spanning tree problems
• Combinatorial optimization problems with two and three criteria
• The problem of the optimal biobjective spanning tree
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• On some multicriteria arborescence problems: Complexity and algorithms
• Indirect covering tree problems on spanning tree networks
• Maximal Direct Covering Tree Problems
• Finding the set of alternatives in discrete multicriterion problems
• Two Algorithms for Generating Weighted Spanning Trees in Order
• An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
• Multicriteria Optimization

This page was built for publication: A Survey on Multiple Objective Minimum Spanning Tree Problems