Sciweavers

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

6

NETWORKS
2007

favoriteEmaildiscussreport

73views Computer Networks» more NETWORKS 2007»

Heuristic solutions for general concave minimum cost network flow problems

13 years 4 months ago

Heuristic solutions for general concave minimum cost network flow problems

Download www.fep.up.pt

Dalila B. M. M. Fontes, José Fernando Gon&c

Real-time Traffic

Computer Networks | NETWORKS 2007 |

claim paper

Related Content

» Convergent Lagrangian heuristics for nonlinear minimum cost network flows

» The VPN Problem with Concave Costs

» A meanvariance model for the minimum cost flow problem with stochastic arc costs

» A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow

» Capacity inverse minimum cost flow problem

» Computing minimum cuts by randomized search heuristics

» A fully polynomial time approximation scheme for timing driven minimum cost buffer inserti...

» Minimum cost capacity installation for multicommodity network flows

» Minimum ratio canceling is oracle polynomial for linear programming but not strongly polyn...

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	NETWORKS
Authors	Dalila B. M. M. Fontes, José Fernando Gonçalves

Comments (0)