Sciweavers

1657 search results - page 94 / 332
» Network flow spanners
Sort
View
DAM
2007
78views more  DAM 2007»
15 years 3 months ago
Flow trees for vertex-capacitated networks
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Refael Hassin, Asaf Levin
IJBC
2007
59views more  IJBC 2007»
15 years 3 months ago
Transport on Complex Networks: Flow, Jamming and Optimization
Bosiljka Tadic, G. J. Rodgers, Stefan Thurner
INFORMS
2007
50views more  INFORMS 2007»
15 years 3 months ago
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
Johannes O. Royset, R. Kevin Wood
IOR
2007
47views more  IOR 2007»
15 years 3 months ago
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Keely L. Croxton, Bernard Gendron, Thomas L. Magna...