| Article ID: | iaor19961054 |
| Country: | Switzerland |
| Volume: | 61 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 20 |
| Publication Date: | Dec 1995 |
| Journal: | Annals of Operations Research |
| Authors: | Jaillet Patrick |
| Keywords: | networks: path |
This paper presents results dealing with properties of well-known geometric random problems in the plane, together with their motivations. It specfically concentrates on the traveling salesman and minimum spanning tree problems, even though most of the results apply to other problems such as the Steiner tree problem and the minimum weight matching problem.