|
|
|
|
|
Davide Bilò, Luciano Gualà and Guido Proietti
Consider a communication network represented by a directed graph ??=(??,??)
G
=
(
V
,
E
)
of n nodes and m edges. Assume that edges in E are partitioned into two sets: a set C of edges with a fixed non-negative real cost, and a set P of edges whose cost...
ver más
|
|
|
|
|