Article ID Journal Published Year Pages File Type
1143413 Operations Research Letters 2006 10 Pages PDF
Abstract
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 profit from the node. The objective is to maximize the worst-case profit.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The competitive salesman problem on a network: a worst-case approach
Authors
, ,