Synthesis of multiterminal communication nets: Finding one or all solutions

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.