Journal ArticleDOI
A graph optimization-synthesis formulation for cable-communications systems
TLDR
The cable-communications systems, m -center, and minimum spanning-tree problems are contained within a general graph optimization-synthesis problem where the total number of vertices is estimated from the length of the spanning tree.Abstract:
The cable-communications systems, m -center, and minimum spanning-tree problems are contained within a general graph optimization-synthesis problem. In the minimum spanningtree problem, a decomposition technique is used in constructing minimal-length trees. This problem is related to the m -center problem where the total number of vertices is estimated from the length of the spanning tree. Both results, vertex estimate and decomposition, are utilized in the cable-communications systems problem. A procedure and example are provided for estimating the dollar cost of a cable-communications system.read more
Citations
More filters
Proceedings ArticleDOI
Optimization framework for topology design challenges in tactical smart microgrid planning
TL;DR: The ability of the proposed heuristic tool is demonstrated on one line (full three phase) diagrams by utilizing the alternating Steiner point introduction method to attain the global optimal solution.
Journal ArticleDOI
Aggregated power consumption in cable-communications systems
TL;DR: An aggregation technique for computing the power required in a cable-communications system is described and provides a relatively simple procedure compared with an exact network method.
References
More filters
Journal ArticleDOI
On the shortest spanning subtree of a graph and the traveling salesman problem
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Journal ArticleDOI
The m-Center Problem
TL;DR: In this paper, a method for solving the m-center problem by solving a finite series of minimum set covering problems is presented. But the problem is not solved in this paper.
Journal ArticleDOI
Constraint Theory, Part I: Fundamentals
TL;DR: The purpose of this paper is to develop an analytic foundation for the determination of whether a mathematical model and its desired computations are "well-posed" in order to help alleviate the software problems associated with the simulation of complex large-scale systems by heterogeneous mathematical models involving several hundred dimensions.