On spanning tree problems with multiple objectives
From MaRDI portal
Recommendations
Cites work
- An Algorithm for Finding K Minimum Spanning Trees
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
- Efficient spanning trees
- scientific article; zbMATH DE number 3980505 (Why is no real title available?)
- Multi-Terminal Network Flows
- Network flows. Theory, algorithms, and applications.
- Note on combinatorial optimization with max-linear objective functions
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Proper efficiency and the theory of vector maximization
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Two Algorithms for Generating Weighted Spanning Trees in Order
Cited in
(78)- 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
- The hybrid spanning tree problem
- On bicriterion minimal spanning trees: An approximation
- Multi-source spanning trees: Algorithms for minimizing source eccentricities.
- Combining linear and nonlinear objectives in spanning tree problems
- A new approach for the multiobjective minimum spanning tree
- Ordered weighted average optimization in multiobjective spanning tree problem
- 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
- The problem of the optimal biobjective spanning tree
- Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Multiobjective routing problems
- Dynamic programming for spanning tree problems: application to the multi-objective case
- Finding multi-objective supported efficient spanning trees
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
- Combining local search and elicitation for multi-objective combinatorial optimization
- Empirical study of exact algorithms for the multi-objective spanning tree
- A decision-theoretic approach to robust optimization in multivalued graphs
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- On the number of non-dominated points of a multicriteria optimization problem
- A survey of recent developments in multiobjective optimization
- On local optima in multiobjective combinatorial optimization problems
- The complexity of minimum ratio spanning tree problems
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- On matroids with multiple objectives
- An exact method to generate all nondominated spanning trees
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- An interactive polyhedral approach for multi-objective combinatorial optimization with incomplete preference information
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
- On possibly optimal tradeoffs in multicriteria spanning tree problems
- scientific article; zbMATH DE number 4139518 (Why is no real title available?)
- Maximal Direct Covering Tree Problems
- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
- 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
- scientific article; zbMATH DE number 3980505 (Why is no real title available?)
- Generalized multiple objective bottleneck problems
- scientific article; zbMATH DE number 4119973 (Why is no real title available?)
- Complexity of spanning tree problems with leaf-dependent objectives
- An analysis on recombination in multi-objective evolutionary optimization
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Simple greedy algorithms for fundamental multidimensional graph problems
- An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
- Optimization problems in multiple subtree graphs
- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
- An improved algorithm to solve the multi-criteria minimum spanning tree problem
- Evolutionary Multi-Criterion Optimization
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
- Minimum spanning trees with sums of ratios.
- Multi-objective matroid optimization with ordinal weights
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- The multi-weighted spanning tree problem
- Biobjective optimization problems on matroids with binary costs
- On solving bi-objective constrained minimum spanning tree problems
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
- Decision making with multiple objectives using GAI networks
- Complexity of the multiobjective minimum weight minimum stretch spanner problem
- Dynamic and static simulated annealing for solving the multi-objective k-minimum spanning tree problem
- Element perturbation problems of optimum spanning trees with two-parameter objectives
- Grouping strategies on two-phase methods for bi-objective combinatorial optimization
- Approximation algorithms for _p-shortest path and _p-group Steiner tree
- New dynamic programming algorithm for the multiobjective minimum spanning tree problem
- The ordered median tree location 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
- 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
This page was built for publication: On spanning tree problems with multiple objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339178)
