| dc.contributor.author | Golden, Bruce L., 1950- | en_US |
| dc.date.accessioned | 2004-05-28T19:30:43Z | |
| dc.date.available | 2004-05-28T19:30:43Z | |
| dc.date.issued | 1976-04 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5264 | |
| dc.description.abstract | This paper is an example of the growing interface between statistics and mathematical optimization. A very efficient heuristic algorithm for the combinatorially intractable TSP is presented, from which statistical estimates of the optimal tour length can be derived. Assumptions, along with computational experience and conclusions are discussed. | en_US |
| dc.description.sponsorship | Supported in part by the U.S. Department of Transportation under contract DOT-TSC-1058, Transportation Advanced Research Program (TARP). | en_US |
| dc.format.extent | 1746 bytes | |
| dc.format.extent | 1334872 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
| dc.relation.ispartofseries | Operations Research Center Working Paper;OR 052-76 | en_US |
| dc.title | A Statistical Approach to the TSP | en_US |
| dc.type | Working Paper | en_US |
