Efficient spanning trees

DOI10.1007/BF00938448zbMath0544.05052MaRDI QIDQ796551

H. W. Corley

Publication date: 1985

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

spanning treePareto optimumvector weights

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Related Items (16)

A multi-agent transgenetic algorithm for the bi-objective spanning tree problem ⋮ On spanning tree problems with multiple objectives ⋮ A new approach for the multiobjective minimum spanning tree ⋮ Balancing profits and costs on trees ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ An exact method to generate all nondominated spanning trees ⋮ On solving bi-objective constrained minimum spanning tree problems ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ A survey of recent developments in multiobjective optimization ⋮ 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 ⋮ Finding multi-objective supported efficient spanning trees ⋮ 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

Cites Work

• Unnamed Item
• Shortest paths in networks with vector weights
• Proper efficiency and the theory of vector maximization
• Multi-Terminal Network Flows
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: Efficient spanning trees