Sciweavers

    51 search results - page 2 / 11
    » On Random Symmetric Travelling Salesman Problems
    Sort
    View
    DISOPT
    2006
    110views more  DISOPT 2006»
    New facets of the STS polytope generated from known facets of the ATS polytope
    13 years 6 months ago
    New facets of the STS polytope generated from known facets of the ATS polytope
    Download  www.dei.unipd.it
    While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
    Egon Balas, Robert Carr, Matteo Fischetti, Neil Si...
    claim paper
    Read More »
    EOR
    2006
    118views more  EOR 2006»
    A random-key genetic algorithm for the generalized traveling salesman problem
    13 years 6 months ago
    A random-key genetic algorithm for the generalized traveling salesman problem
    Download  www.lehigh.edu
    The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
    Lawrence V. Snyder, Mark S. Daskin
    claim paper
    Read More »
    MOR
    2010
    111views more  MOR 2010»
    Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
    13 years 5 months ago
    Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
    Download  www2.isye.gatech.edu
    We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
    William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
    claim paper
    Read More »
    DISOPT
    2008
    93views more  DISOPT 2008»
    Exploiting planarity in separation routines for the symmetric traveling salesman problem
    13 years 6 months ago
    Exploiting planarity in separation routines for the symmetric traveling salesman problem
    Download  www.lancs.ac.uk
    At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
    Adam N. Letchford, Nicholas A. Pearson
    claim paper
    Read More »
    ICEC
    1996
    106views more  ICEC 1996»
    A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems
    13 years 8 months ago
    A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems
    Download  www.morris.umn.edu
    Bernd Freisleben, Peter Merz
    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.