Developing Systems

A range of extremal combinatorial problems in design of multicomponent networks

O. Yu. Pershin

Moscow

Abstract: A range of problems in design of optimal networks is introduced and studied. By using an extremal combinatorial model the complexity of such problems is classified. A basic branch-and-bound solution flowchart is proposed.

UDC: 62-505.15


Received: 16.01.1985