Sciweavers

    55 search results - page 1 / 11
    » A linear programming formulation of Mader's edge-disjoint pa...
    Sort
    View
    JCT
    2006
    36views more  JCT 2006»
    A linear programming formulation of Mader's edge-disjoint paths problem
    13 years 5 months ago
    A linear programming formulation of Mader's edge-disjoint paths problem
    Download  www.win.tue.nl
    Judith Keijsper, Rudi Pendavingh, Leen Stougie
    claim paper
    Read More »
    OSN
    2007
    185views more  OSN 2007»
    Comparison of ILP formulations for the RWA problem
    13 years 5 months ago
    Comparison of ILP formulations for the RWA problem
    Download  users.encs.concordia.ca
    — We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
    Brigitte Jaumard, Christophe Meyer, B. Thiongane
    claim paper
    Read More »
    COR
    2010
    108views more  COR 2010»
    GRASP and path relinking for the max-min diversity problem
    13 years 5 months ago
    GRASP and path relinking for the max-min diversity problem
    Download  www.uv.es
    The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
    Mauricio G. C. Resende, Rafael Martí, Micae...
    claim paper
    Read More »
    EOR
    2006
    65views more  EOR 2006»
    Dynamic programming and minimum risk paths
    13 years 5 months ago
    Dynamic programming and minimum risk paths
    Download  users.dimi.uniud.it
    : This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
    Paolo Serafini
    claim paper
    Read More »
    HEURISTICS
    2002
    155views more  HEURISTICS 2002»
    Bounds and Heuristics for the Shortest Capacitated Paths Problem
    13 years 5 months ago
    Bounds and Heuristics for the Shortest Capacitated Paths Problem
    Download  www.gerad.ca
    Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
    Marie-Christine Costa, Alain Hertz, Michel Mittaz
    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.