Sciweavers

    3 search results - page 1 / 1
    » On capacitated network design cut-set polyhedra
    Sort
    View
    MP
    2002
    183views more  MP 2002»
    On splittable and unsplittable flow capacitated network design arc-set polyhedra
    15 years 2 months ago
    On splittable and unsplittable flow capacitated network design arc-set polyhedra
    Download  www.ieor.berkeley.edu
    We study the polyhedra of splittable and unsplittable single arc
    Alper Atamtürk, Deepak Rajan
    claim paper
    Read More »
    MP
    2002
    96views more  MP 2002»
    On capacitated network design cut-set polyhedra
    15 years 2 months ago
    On capacitated network design cut-set polyhedra
    Download  www.ieor.berkeley.edu
    Abstract. This paper provides an analysis of capacitated network design cut
    Alper Atamtürk
    claim paper
    Read More »
    NETWORKS
    2011
    226views Computer Networks» more  NETWORKS 2011»
    On cut-based inequalities for capacitated network design polyhedra
    14 years 9 months ago
    On cut-based inequalities for capacitated network design polyhedra
    Download  www.matheon.de
    In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
    Christian Raack, Arie M. C. A. Koster, Sebastian O...
    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.