The competitive salesman problem on a network: a worst-case approach

  • Authors:

  • Igor Averbakh;Vasilij Lebedev

  • Affiliations:

  • Division of Management, University of Toronto at Scarborough, 1265 Military Trail, Scarborough, Ont., Canada, M1C 1A4;Department of Mathematics, Volgograd State University, Volgograd 400062, Russia

  • Venue:
  • Operations Research Letters
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.