| Article ID: | iaor20062269 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 2 |
| Start Page Number: | 165 |
| End Page Number: | 174 |
| Publication Date: | Mar 2006 |
| Journal: | Operations Research Letters |
| Authors: | Averbakh Igor, Lebedev Vasilij |
| Keywords: | programming: travelling salesman, combinatorial analysis, programming: transportation |
We provide a complexity analysis of the problem of optimal routing of a server on a transportation network in the presence of a competing server. The server that reaches a node first gets the profits from the node. The objective is to maximize the worst-case profit.