Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5196Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Jaillet, Patrick | - |
| dc.date | 2004-05-28T19:27:31Z | - |
| dc.date | 2004-05-28T19:27:31Z | - |
| dc.date | 1990-11 | - |
| dc.date.accessioned | 2013-10-09T02:38:16Z | - |
| dc.date.available | 2013-10-09T02:38:16Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5196 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | For a sample of points drawn uniformly from either the d-dimensional torus or the d-cube, d > 2, we define a class of random processes with the property of being asymptotically equivalent in expectation in the two models. Examples include the traveling salesman problem (TSP), the minimum spanning tree problem (MST), etc. Application of this result helps closing down one open question: We prove that the analytical expression recently obtained by Avram and Bertsimas for the MST constant in the d-torus model is in fact valid for the traditional d-cube model. For the MST, we also extend our result and show that stronger equivalences hold. Finally we present some remarks on the possible use of the d-torus model for exploring rates of convergence for the TSP in the square. | - |
| dc.format | 1172143 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 234-90 | - |
| dc.title | Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant | - |
| dc.type | Working Paper | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.