Minimum-cost strong network orientation
β
Burkard, Rainer E.; Feldbacher, Karin; Klinz, Bettina; Woeginger, Gerhard J.
π
Article
π
1999
π
John Wiley and Sons
π
English
β 184 KB
In the minimum-cost strong network orientation problem (MCSO), we are given an undirected graph G Γ (V, E) with nonnegative edge lengths α(e) and a transportation schedule T Γ {(s 1 , t 1 , w 1 ), . . . , (s k , t k , w k )}, where w i units of weight have to be transported from the source vertex s