Sciweavers

    57 search results - page 1 / 12
    » Combinatorial algorithms for the minimum interval cost flow ...
    Sort
    View
    AMC
    2006
    109views more  AMC 2006»
    Combinatorial algorithms for the minimum interval cost flow problem
    13 years 6 months ago
    Combinatorial algorithms for the minimum interval cost flow problem
    Download  math-cs.aut.ac.ir
    S. Mehdi Hashemi, Mehdi Ghatee, Ebrahim Nasrabadi
    claim paper
    Read More »
    STOC
    1999
    ACM
    132views Algorithms» more  STOC 1999»
    A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
    13 years 10 months ago
    A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
    Download  www.cs.princeton.edu
    We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
    Kevin D. Wayne
    claim paper
    Read More »
    IPCO
    1998
    94views Optimization» more  IPCO 1998»
    An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
    13 years 7 months ago
    An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
    Download  theory.stanford.edu
    Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Pl...
    claim paper
    Read More »
    ALGORITHMICA
    2010
    127views more  ALGORITHMICA 2010»
    An Algorithm for Minimum Cost Arc-Connectivity Orientations
    13 years 6 months ago
    An Algorithm for Minimum Cost Arc-Connectivity Orientations
    Download  www.ism.ac.jp
    Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
    Satoru Iwata, Yusuke Kobayashi
    claim paper
    Read More »
    EOR
    2008
    106views more  EOR 2008»
    Convergent Lagrangian heuristics for nonlinear minimum cost network flows
    13 years 6 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
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.