Sciweavers

    HIS
    2008
    117views Information Technology» more  HIS 2008»
    Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
    13 years 9 months ago
    Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
    Download  www.ads.tuwien.ac.at
    The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
    Bin Hu, Günther R. Raidl
    claim paper
    Read More »
    WADS
    2005
    Springer
    187views Algorithms» more  WADS 2005»
    Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
    14 years 1 months ago
    Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
    Download  www-cc.cs.uni-saarland.de
    We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
    Markus Bläser, L. Shankar Ram, Maxim Sviriden...
    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.