A Statistical Approach to the TSP

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5264

Full metadata record

DC Field	Value	Language
dc.creator	Golden, Bruce L., 1950-	-
dc.date	2004-05-28T19:30:43Z	-
dc.date	2004-05-28T19:30:43Z	-
dc.date	1976-04	-
dc.date.accessioned	2013-10-09T02:38:41Z	-
dc.date.available	2013-10-09T02:38:41Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5264	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.description	Supported in part by the U.S. Department of Transportation under contract DOT-TSC-1058, Transportation Advanced Research Program (TARP).	-
dc.format	1746 bytes	-
dc.format	1334872 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 052-76	-
dc.title	A Statistical Approach to the TSP	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI