Sciweavers

    IOR
    2006
    173views more  IOR 2006»
    A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
    13 years 4 months ago
    A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
    Download  www.iro.umontreal.ca
    In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
    Jean-François Cordeau
    claim paper
    Read More »
    DISOPT
    2008
    91views more  DISOPT 2008»
    Partition inequalities for capacitated survivable network design based on directed p-cycles
    13 years 4 months ago
    Partition inequalities for capacitated survivable network design based on directed p-cycles
    Download  www.ieor.berkeley.edu
    We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
    Alper Atamtürk, Deepak Rajan
    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.