Sciweavers

    2 search results - page 1 / 1
    » Cycle-based algorithms for multicommodity network flow probl...
    Sort
    View
    NETWORKS
    2008
    127views Computer Networks» more  NETWORKS 2008»
    Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
    15 years 3 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...
    claim paper
    Read More »
    EOR
    2008
    106views more  EOR 2008»
    Convergent Lagrangian heuristics for nonlinear minimum cost network flows
    15 years 3 months ago
    Convergent Lagrangian heuristics for nonlinear minimum cost network flows
    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 »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.