Sciweavers

IPCO   1992 International Conference on Integer Programming and Combinatorial Optimization
Wall of Fame | Most Viewed IPCO-1992 Paper
IPCO
1992
115views Optimization» more  IPCO 1992»
14 years 5 hour ago
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
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
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source115
2Download preprint from source112
3Download preprint from source111
4Download preprint from source100