Sciweavers

    2 search results - page 1 / 1
    » Effective Tour Searching for TSP by Contraction of Pseudo Ba...
    Sort
    View
    AAIM
    2009
    Springer
    91views Algorithms» more  AAIM 2009»
    Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
    16 years 11 days ago
    Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
    Download  www.informatik.uni-kiel.de
    Changxing Dong, Gerold Jäger, Dirk Richter, P...
    claim paper
    Read More »
    AAIM
    2010
    Springer
    165views Algorithms» more  AAIM 2010»
    Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
    15 years 9 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
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.