minimal cut setsoptimal construction cost.transmission network expansion planningThis research proposes a method based on the graph theory for transmission network expansion planning. The proposed method suggests an optimal investment cost for transmission network expansion planning by using the minimal cut ...
In subject area: Engineering A cut set is a minimal set of branches K of a connected graph G, such that the removal of all K branches divides the graph into two parts. From: Power Systems Analysis (Second Edition), 2017 About this pageSet alert ...
In doing so, the algorithm combines two techniques: (1) an approach Tsukiyama et al. [12] used to list the minimal cutsets of a graph by growing a connected component around a vertex a and (2) a generalization of the concept of a separator close to a vertex, introduced by Kloks and...
so that the singular capacity of the finite set of minimal hypersurfaces mentioned above would decrease at least by 1. once this is established, by a simple induction argument, one will be able to find a metric where all the minimal hypersurfaces with bounded area and bounded index have 0 si...
(locality limited linear coding and bag of words). In the second approach, convolutional neural networks are designed. The afflicted lesions were isolated by Ahammed et al.19using the automatic Grabcut segmentation approach. We utilize statistical features and Gray Level Co-occurrence Matrix (GLCM)...
set: A set as defined in mathematics by the axioms of set theory.rule: An artificial constraint. Unlike a physical constraint which can apply to various portions of a model, an artificial constraint applies to individual members of a society, and said members can decide whether to follow it....
cutset of the WLFG is given such that (1) a maximal cutset does not contain two arcs that lie on a single path of the WLFG, and (2) its capacity is equal to the cardinality of a minimal set of base paths of the program. The algorithm repeatedly finds an eliminable arc and ...
For example, at \(\varepsilon = 0.26\), the pentagonal cycle gets cut to a shorter quadrilateral, albeit with an individual longer edge. This evolution is accounted for in the minimal scaffold, which displays the triangle-rich structure mentioned above. (b) The resulting minimal scaffold (...
The composite power system reliability analysis is generally based on minimal path or cut enumeration, tracing of power flow paths from which the related reliability indices are calculated. The minimal cut set is a popular method in the reliability analysis for simple and complex configurations. Avera...
This paper makes full use of Cross Entropy method to obtain the best estimator for the max-cut problem which is a standard NP-hard problem in graph graphic theory. 交叉熵方法(Cross Entropy)是近几年发展而来的一种启发式方法,在求解组合优化问题中显示出其简单有效的特点,将运用交叉熵方法(CE)寻求...