Title :
Synthesis of multiterminal communication nets: Finding one or all solutions
Author :
Agarwal, Ashok K. ; Arora, Sant R.
fDate :
3/1/1976 12:00:00 AM
Abstract :
In this paper, the synthesis problem of multi-terminal nets is formulated as a mathematical programming problem. An algorithm based on Balinski´s procedure of finding all the vertices of a convex polyhedra is described to determine one or all the feasible solutions of the synthesis problem.
Keywords :
Communication networks; Graph theory and network topology; Mathematical programming; Biographies; Circuits and systems; Context; Joining processes; Levee; Mathematical programming; Mechanical engineering; Sufficient conditions; Symmetric matrices;
Journal_Title :
Circuits and Systems, IEEE Transactions on
DOI :
10.1109/TCS.1976.1084194
