Finding multi-objective supported efficient spanning trees

Recommendations

On spanning tree problems with multiple objectives
Empirical study of exact algorithms for the multi-objective spanning tree
Minimum spanning trees made easier via multi-objective optimization
Publication:4733693
A new approach for the multiobjective minimum spanning tree
A Survey on Multiple Objective Minimum Spanning Tree Problems
On possibly optimal tradeoffs in multicriteria spanning tree problems
Dynamic programming for spanning tree problems: application to the multi-objective case
Evolutionary Multi-Criterion Optimization
Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization

Cites work

A minimum spanning tree algorithm with inverse-Ackermann type complexity
A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
A randomized linear-time algorithm to find minimum spanning trees
A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
A Survey on Multiple Objective Minimum Spanning Tree Problems
Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
Computing all efficient solutions of the biobjective minimum spanning tree problem
Connectedness of efficient solutions in multiple criteria combinatorial optimization
Connectedness of efficient solutions in multiple objective combinatorial optimization
Dynamic programming for spanning tree problems: application to the multi-objective case
Efficient spanning trees
Genetic algorithm approach on multi-criteria minimum spanning tree problem
Graphical exploration of the weight space in three-objective mixed integer linear programs
scientific article; zbMATH DE number 51430 (Why is no real title available?)
scientific article; zbMATH DE number 1820633 (Why is no real title available?)
Multicriteria Optimization
Multiple objective optimization and implications for single objective optimization.
Network flows. Theory, algorithms, and applications.
On bicriterion minimal spanning trees: An approximation
On spanning tree problems with multiple objectives
On the shortest spanning subtree of a graph and the traveling salesman problem
Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
Proper efficiency and the theory of vector maximization
Spanning Trees and Optimization Problems
The problem of the optimal biobjective spanning tree

Cited in

(5)

A Survey on Multiple Objective Minimum Spanning Tree Problems
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
New dynamic programming algorithm for the multiobjective minimum spanning tree problem
Minimum spanning trees made easier via multi-objective optimization

This page was built for publication: Finding multi-objective supported efficient spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028494)