Profit-based latency problems on the line

S. Coene, F.C.R. Spieksma

Research output: Contribution to journalArticleAcademicpeer-review

13 Citations (Scopus)


We consider a latency problem with a profit
pi for each client. When serving a client, a revenue of
pi−t is collected. The goal is to find routes for the servers such that total collected revenue is maximized. We study the complexity of different variants of this problem on the line.
Original languageEnglish
Pages (from-to)333-337
JournalOperations Research Letters
Issue number3
Publication statusPublished - May 2008
Externally publishedYes


  • minimum latency
  • traveling repairman
  • dynamic programming
  • complexity


Dive into the research topics of 'Profit-based latency problems on the line'. Together they form a unique fingerprint.

Cite this