“…Independently in [7] and [8] it was proved that RWA problem is N P-complete. Formulations proposed in the literature ( [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20]) differ from formulation proposed in the following in terms of graph construction. Namely, in this paper it is assumed that each λ channel constitutes separate edge in the network graph.…”