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
2
search results - page 1 / 1
»
Cycle-based algorithms for multicommodity network flow probl...
Sort
relevance
views
votes
recent
update
View
thumb
title
8
click to vote
NETWORKS
2008
127
views
Computer Networks
»
more
NETWORKS 2008
»
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
13 years 4 months ago
Download
www.isima.fr
Maurício C. de Souza, Philippe Mahey, Berna...
claim paper
Read More »
10
click to vote
EOR
2008
106
views
more
EOR 2008
»
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
13 years 4 months ago
Download
www.math.chalmers.se
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »