Efficient spanning trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Multi-Terminal Network Flows
- Proper efficiency and the theory of vector maximization
- Shortest paths in networks with vector weights
- The Traveling-Salesman Problem and Minimum Spanning Trees
Cited in
(24)- scientific article; zbMATH DE number 742889 (Why is no real title available?)
- A preference-based approach to spanning trees and shortest paths problems
- The problem of the optimal biobjective spanning tree
- Priority-Consistent Graphs
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
- Finding all nondominated points of multi-objective integer programs
- scientific article; zbMATH DE number 4139518 (Why is no real title available?)
- Minimax trees, paths, and cut sets
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- A new approach for the multiobjective minimum spanning tree
- Empirical study of exact algorithms for the multi-objective spanning tree
- Improving spanning trees by upgrading nodes
- An exact method to generate all nondominated spanning trees
- Finding multi-objective supported efficient spanning trees
- scientific article; zbMATH DE number 637297 (Why is no real title available?)
- scientific article; zbMATH DE number 4156454 (Why is no real title available?)
- Balancing profits and costs on trees
- A survey of recent developments in multiobjective optimization
- On spanning tree problems with multiple objectives
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- On solving bi-objective constrained minimum spanning tree problems
- Generating the maximum spanning trees of a weighted graph
- A Survey on Multiple Objective Minimum Spanning Tree Problems
This page was built for publication: Efficient spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796551)