Efficient spanning trees
From MaRDI portal
Publication:796551
DOI10.1007/BF00938448zbMATH Open0544.05052MaRDI QIDQ796551FDOQ796551
Authors: H. W. Corley
Publication date: 1985
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (24)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Finding all nondominated points of multi-objective integer programs
- Minimax trees, paths, and cut sets
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Improving spanning trees by upgrading nodes
- A new approach for the multiobjective minimum spanning tree
- Empirical study of exact algorithms for the multi-objective spanning tree
- An exact method to generate all nondominated spanning trees
- Finding multi-objective supported efficient spanning trees
- Title not available (Why is that?)
- Balancing profits and costs on trees
- Title not available (Why is that?)
- 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)