On spanning tree problems with multiple objectives
From MaRDI portal
Publication:1339178
DOI10.1007/BF02032304zbMath0821.90126MaRDI QIDQ1339178
Günter Ruhe, Horst W. Hamacher
Publication date: 1 December 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
rankingNP-completeexact algorithmapproximation schememultiple-objective minimum spanning treenetwork with vectorial weights
Related Items
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs, Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach, A multi-agent transgenetic algorithm for the bi-objective spanning tree problem, A decision-theoretic approach to robust optimization in multivalued graphs, Heuristic approaches for biobjective mixed 0-1 integer linear programming problems, Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows, Computing all efficient solutions of the biobjective minimum spanning tree problem, On bicriterion minimal spanning trees: An approximation, A new approach for the multiobjective minimum spanning tree, An efficient procedure for finding best compromise solutions to the multi-objective assignment problem, Minimum spanning trees made easier via multi-objective optimization, Choquet-based optimisation in multiobjective shortest path and spanning tree problems, Approximation Methods for Multiobjective Optimization Problems: A Survey, Multiobjective routing problems, Randomized local search, evolutionary algorithms, and the minimum spanning tree problem, Multi-objective matroid optimization with ordinal weights, Two‐phase strategies for the bi‐objective minimum spanning tree problem, An exact method to generate all nondominated spanning trees, Biobjective optimization problems on matroids with binary costs, Decision making with multiple objectives using GAI networks, On the number of non-dominated points of a multicriteria optimization problem, An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information, An analysis on recombination in multi-objective evolutionary optimization, A GRASP algorithm for the multi-criteria minimum spanning tree problem, A survey of recent developments in multiobjective optimization, On local optima in multiobjective combinatorial optimization problems, Ordered weighted average optimization in multiobjective spanning tree problem, Multicriteria path and tree problems: discussion on exact algorithms and applications, An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem, Greedy algorithms for a class of knapsack problems with binary weights, Exact algorithms for OWA-optimization in multiobjective spanning tree problems, Two-phase Pareto local search for the biobjective traveling salesman problem, 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, Dynamic programming for spanning tree problems: application to the multi-objective case, On matroids with multiple objectives, Finding multi-objective supported efficient spanning trees, Combining local search and elicitation for multi-objective combinatorial optimization, Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, The problem of the optimal biobjective spanning tree, Empirical study of exact algorithms for the multi-objective spanning tree, A Survey on Multiple Objective Minimum Spanning Tree Problems, Optimality conditions in preference-based spanning tree problems, Combinatorial optimization in system configuration design, Connectedness of efficient solutions in multiple criteria combinatorial optimization, Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis, Geometric methods to solve max-ordering location problems
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
