| Article ID: | iaor19931581 |
| Country: | United Kingdom |
| Volume: | 43 |
| Issue: | 5 |
| Start Page Number: | 533 |
| End Page Number: | 538 |
| Publication Date: | May 1992 |
| Journal: | Journal of the Operational Research Society |
| Authors: | McDiarmid C. |
The ‘random part’ of an operations research model may be less satisfactory than the ‘deterministic part’, and it may thus be desirable to design algorithms that require few probability assumptions and make few calls to a suitable ‘probability oracle’. The paper considers here the problem of locating a service facility on a tree network so as to minimize the expected length of a travelling salesman tour through a random set of demand nodes.