Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

77

IPCO
1998

favoriteEmaildiscussreport

94views Optimization» more IPCO 1998»

An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow

14 years 10 months ago

An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow

Download theory.stanford.edu

Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Pl

Real-time Traffic

IPCO 1998 | IPCO 2007 |

claim paper

Related Content

» A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow

» Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

» Convergent Lagrangian heuristics for nonlinear minimum cost network flows

» Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problem...

» Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flo...

» A fixedparameter tractability result for multicommodity demand flow in trees

» Routing multiclass traffic flows in the plane

» Multiline Addressing by Network Flow

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	IPCO
Authors	Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein

Comments (0)