Sciweavers

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

35

NETWORKS
2008

favoriteEmaildiscussreport

127views Computer Networks» more NETWORKS 2008»

Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs

13 years 10 months ago

Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs

Download www.isima.fr

Maurício C. de Souza, Philippe Mahey, Berna

Real-time Traffic

Computer Networks | NETWORKS 2008 |

claim paper

Related Content

» Convergent Lagrangian heuristics for nonlinear minimum cost network flows

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	NETWORKS
Authors	Maurício C. de Souza, Philippe Mahey, Bernard Gendron

Comments (0)