Sciweavers

    IPCO
    1992
    115views Optimization» more  IPCO 1992»
    When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
    15 years 4 months ago
    When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
    Download  www.math.cmu.edu
    We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...
    Alan M. Frieze, Richard M. Karp, Bruce A. Reed
    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.