IPCO 1992 - PDF Preprint Papers

IPCO 1992 International Conference on Integer Programming and Combinatorial Optimization

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPCO-1992 Paper

click to vote

IPCO
1992

115views Optimization» more IPCO 1992»

When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?

13 years 6 months ago

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 »

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.

Id	Views	Title	Status

1	115	When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?	claim
2	112	The Metric Polytope	claim
3	111	A Technique for Speeding up the Solution of the Lagrangian Dual	claim
4	100	An Exact Characterization of Greedy Structures	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers