Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
25
click to vote
NETWORKS
2007
favorite
Email
discuss
report
73
views
Computer Networks
»
more
NETWORKS 2007
»
Heuristic solutions for general concave minimum cost network flow problems
13 years 10 months ago
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...
more »
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)
Researcher Info
Computer Networks Study Group
Computer Vision