Results 331 to 340 of about 248,790 (377)
Some of the next articles are maybe not open access.
, 2016
The wind farm layout optimisation problem is similar to the classic mathematical problem of finding the minimum spanning tree (MST) of a weighted undirected graph.
P. Hou, Weihao Hu, Zhe Chen
semanticscholar +1 more source
The wind farm layout optimisation problem is similar to the classic mathematical problem of finding the minimum spanning tree (MST) of a weighted undirected graph.
P. Hou, Weihao Hu, Zhe Chen
semanticscholar +1 more source
The Capacitated Minimum Spanning Tree
Networks, 1973AbstractThe capacitated minimum spanning tree is an offspring of the minimum spanning tree and network flow problems. It has application in the design of multipoint linkages in elementary teleprocessing tree networks. Some theorems are used in conjunction with Little's branch and bound algorithm to obtain optimal solutions.
K. M. Chandy, Tachen Lo
openaire +2 more sources
, 2016
The approach in this study has been developed to optimise the cable connection layout of large-scale offshore wind farms. The objective is to minimise the levelised production cost (LPC) of an offshore wind farm by optimising the cable connection ...
P. Hou, Weihao Hu, Cong Chen, Zhe Chen
semanticscholar +1 more source
The approach in this study has been developed to optimise the cable connection layout of large-scale offshore wind farms. The objective is to minimise the levelised production cost (LPC) of an offshore wind farm by optimising the cable connection ...
P. Hou, Weihao Hu, Cong Chen, Zhe Chen
semanticscholar +1 more source
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem
Networks, 2019This paper addresses a variant of the minimum spanning tree problem in which, given a list of conflicting edges, the primary goal is to find a spanning tree with the minimum number of conflicting edge pairs and the secondary goal is to minimize the ...
F. Carrabs +2 more
semanticscholar +1 more source
Finding Minimum Congestion Spanning Trees
ACM Journal of Experimental Algorithmics, 1999Given a weighted graph <i>G = (V, E)</i>, a positive integer <i>k</i>, and a penalty function <i>w<inf>p</inf></i>, we want to find <i>k</i> spanning trees on <i>G</i>, not necessarily disjoint, of minimum total weight, such that the weight of each edge is subject to a penalty ...
Renato F. Werneck +2 more
openaire +3 more sources
Proceedings of the Institution of Electrical Engineers, 1975 I. Cahit, R. Cahit
openaire +1 more source
A Role of Minimum Spanning Tree
2019In a wireless sensor network, a topology control problem aims to adjust power of sensors so that the topology supported by the power has some desirable property and the total power is as small as possible. In this chapter, we shall present studies on the topology control problem with the properties of containing a spanning tree, a strongly connected ...
Zhao Zhang, Xiaohui Huang
openaire +2 more sources
Minimum Spanning Tree with Neighborhoods
2007We consider a natural generalization of the classical minimum spanning tree problem called Minimum Spanning Tree with Neighborhoods (MSTN)which seeks a tree of minimum length to span a set of 2D regions called neighborhoods. Each neighborhood contributes exact one node to the tree, and the MSTN has the minimum total length among all possible trees ...
Mingen Lin +3 more
openaire +2 more sources
CLUSTERING WITH MINIMUM SPANNING TREES
International Journal on Artificial Intelligence Tools, 2011We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of a set of representative points and removes edges that satisfy a
Yan Zhou +2 more
openaire +2 more sources
Enhancement of Minimum Spanning Tree
2016Importance of minimum spanning tree is used to find the smallest path which includes all the nodes in the network. Minimum spanning tree can be obtained using classical algorithms such as, Boruvka’s, Prim’s, and Kruskal. This research paper contains a survey on the classical and recent algorithms which used different techniques to find minimum spanning
Nimesh Patel, K. M. Patel
openaire +2 more sources