Sciweavers

    AAIM
    2010
    Springer
    165views Algorithms» more  AAIM 2010»
    Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
    14 years 4 months ago
    Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
    Download  www.informatik.uni-kiel.de
    Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
    Christian Ernst, Changxing Dong, Gerold Jäger...
    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.