Some of the schisms were theological conflicts foreshadowed in the apostolic church; others were internal quarrels related to liturgical differences, power politics between different patriarchates or church centres, problems of discipline and piety, or social and cultural conflicts.
By the time it was spread out to other centres, problems were still being identified.
Instead, we can use an approach to the vertex p-centres problem [15] to determine the representative of the top-k anchors.
It is well know that the optimal GW deployment can be formulated as a vertex k-centre problem.
However, achieving the optimal solution of a k-centre problem is highly complex due to its large solution space.
However, in our case, we only consider the case of p=1, i.e., the 1-centre problem.
Simulation results show that the proposed t-step substitution algorithm can significantly reduce the solution space of the k-centre problem by up to 80%.
A VNS-based heuristic using both a facility as well as a customer type neighbourhood structure is proposed to solve the p-centre problem in the continuous space.
A self-adaptive heuristic that incorporates a variable level of perturbation, a novel local search and a learning mechanism is proposed to solve the p-centre problem in the continuous space.
As a by-product of this research, we also report for the first time the optimal solution of the vertex p-centre problem for these TSP-Lib data sets.
The elimination of weight and excessive thrust, the freedom in the use of materials, and the absence of centring problems favoured the simple barrel vault and made more complex types obsolete.
