Sciweavers

    84
    Voted
    NETWORKS
    2007
    91views Computer Networks» more  NETWORKS 2007»
    Hardness of robust network design
    15 years 2 days ago
    Hardness of robust network design
    Download  www.cs.uiuc.edu
    Chandra Chekuri, F. Bruce Shepherd, G. Oriolo, Mar...
    claim paper
    Read More »
    77
    Voted
    NETWORKS
    2007
    83views Computer Networks» more  NETWORKS 2007»
    The vehicle rescheduling problem: Model and algorithms
    15 years 2 days ago
    The vehicle rescheduling problem: Model and algorithms
    Download  path.berkeley.edu
    Jing-Quan Li, Pitu B. Mirchandani, Denis Borenstei...
    claim paper
    Read More »
    NETWORKS
    2007
    75views Computer Networks» more  NETWORKS 2007»
    Maximum independent set for intervals by divide and conquer with pruning
    15 years 2 days ago
    Maximum independent set for intervals by divide and conquer with pruning
    Download  www.cs.ust.hk
    Jack Snoeyink
    claim paper
    Read More »
    NETWORKS
    2007
    135views Computer Networks» more  NETWORKS 2007»
    Survivable IP network design with OSPF routing
    15 years 2 days ago
    Survivable IP network design with OSPF routing
    Download  www.optimization-online.org
    Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
    Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
    claim paper
    Read More »
    113
    Voted
    NETWORKS
    2007
    144views Computer Networks» more  NETWORKS 2007»
    Models and branch-and-cut algorithms for pickup and delivery problems with time windows
    15 years 2 days ago
    Models and branch-and-cut algorithms for pickup and delivery problems with time windows
    Download  www.diku.dk
    In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
    Stefan Ropke, Jean-François Cordeau, Gilber...
    claim paper
    Read More »
    NETWORKS
    2007
    87views Computer Networks» more  NETWORKS 2007»
    The two-median problem on Manhattan meshes
    15 years 2 days ago
    The two-median problem on Manhattan meshes
    Download  www.cs.ust.hk
    Mordecai J. Golin, Yan Zhang
    claim paper
    Read More »
    110
    Voted
    NETWORKS
    2007
    127views Computer Networks» more  NETWORKS 2007»
    Metaheuristics for the vehicle routing problem with loading constraints
    15 years 2 days ago
    Metaheuristics for the vehicle routing problem with loading constraints
    Download  prolog.univie.ac.at
    We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
    Karl F. Doerner, Guenther Fuellerer, Richard F. Ha...
    claim paper
    Read More »
    NETWORKS
    2007
    84views Computer Networks» more  NETWORKS 2007»
    A hub covering model for cargo delivery systems
    15 years 2 days ago
    A hub covering model for cargo delivery systems
    Download  www.bilkent.edu.tr
    Pinar Z. Tan, Bahar Yetis Kara
    claim paper
    Read More »
    98
    Voted
    NETWORKS
    2007
    117views Computer Networks» more  NETWORKS 2007»
    Acceleration of cutting-plane and column generation algorithms: Applications to network design
    15 years 2 days ago
    Acceleration of cutting-plane and column generation algorithms: Applications to network design
    Download  www.math.tu-dresden.de
    Walid Ben-Ameur, José Neto
    claim paper
    Read More »
    111
    Voted
    NETWORKS
    2007
    87views Computer Networks» more  NETWORKS 2007»
    Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
    15 years 2 days ago
    Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
    Download  www.ulb.ac.be
    The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
    Luigi De Giovanni, Roberto Tadei
    claim paper
    Read More »
    12next ›last »
    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-2025, USA.