An analysis is made of the computational complexity of a class of heuristic algorithms for the solution of the minimal spanning tree problem subject to a restriction on the maximum number (or weight) of nodes in any subtree rooted at a distinguished node. This is of particular interest in ...
Gavish B. (1983) Formulations and algorithms for the capacitated minimal directed tree problem. J. ACM 30, 118–132 ArticleMATHMathSciNetGoogle Scholar Gouveia L. (1995) A 2n-constraint formulation for the capacitated minimal spanning tree problem. Oper. Res. 43, 130–141 ...
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem Bezalel,Gavish - 《Journal of the Acm》 被引量: 298发表: 1983年 Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem The capacitated minimum spanning tree (CMST) problem is to find a ...
The Capacitated Minimal Spanning Tree Problem: An Experiment with a Hop-Indexed Model The Capacitated Minimal Spanning Tree Problem (CMSTP) is to find a minimal spanningtree with an additional cardinality constraint on the size of the subtre... L Gouveia,P Martins - 《Annals of Operations Resear...
Capacitated minimal spanning tree problemEsau–Williams heuristicFuzzy logicFuzzy algorithmSimulationThe classical Capacitated Minimum Spanning Tree Problem (CMSTP) deals with finding a minimum-cost spanning tree so that the total demand of the vertices in each subtree does not exceed the capacity ...
capacitated minimal spanning tree problemIn this paper, we compare linear integer programming directed formulations for the capacitated minimal spanning tree (CMST) problem. This problem is directly related to network design and consists of finding the cheapest way to link a set of terminals at ...
capacitated minimal spanning tree problemEsau–Williams heuristicThe Capacitated Minimum Spanning Tree Problem is NP-hard and several heuristic solution methods have been proposed. They can be classified as classical ones and metaheuristics. Recent developments have shown that metaheuristics outperform ...
Bricker, A multiperiod planning model for the capacitated minimal spanning tree problem, European Journal of Operational Research 121 (2000) 412-419.Kawatra, R., Bricker, D.L.: A multi-period planning model for the capacitated minimal spanning tree problem. European Journal of Operational Research...
This work addresses the multi-level capacitated minimum spanning tree (MLCMST) problem. It consists of finding a minimal cost spanning tree such that the flow to be transferred from a central node (root) to the other nodes is bounded by the edge capacities. In this paper, a hybrid ...
The capacitated degree constrained min-sum arborescence problem consists of finding a directed spanning tree in a network to connect a set of terminal nodes to a central node with minimal total cost where the links in the network are directed away from the central node. The number links ...