Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.orl.2005.04.006 | Oper. Res. Lett. |
Keywords | Field | DocType |
transportation network,competitive salesman problem,complexity analysis,worst-case profit,worst-case approach,competing server,optimal routing,traveling salesman,profitability | Flow network,Mathematical optimization,Benefice,Travelling salesman problem,Polynomial algorithm,Mathematics,Polynomial method | Journal |
Volume | Issue | ISSN |
34 | 2 | Operations Research Letters |
Citations | PageRank | References |
1 | 0.42 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Averbakh | 1 | 699 | 54.76 |
| Vasilij Lebedev | 2 | 129 | 6.32 |