Sciweavers

    7 search results - page 2 / 2
    » The traveling salesman problem with pickup and delivery: pol...
    Sort
    View
    TAMC
    2009
    Springer
    140views Applied Computing» more  TAMC 2009»
    On the Complexity of the Multiple Stack TSP, kSTSP
    13 years 10 months ago
    On the Complexity of the Multiple Stack TSP, kSTSP
    Download  www-lipn.univ-paris13.fr
    Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
    Sophie Toulouse, Roberto Wolfler Calvo
    claim paper
    Read More »
    MP
    2010
    163views more  MP 2010»
    Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
    13 years 3 days ago
    Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
    Download  www.zaik.uni-koeln.de
    In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
    Christoph Buchheim, Frauke Liers, Marcus Oswald
    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.