Profit-based latency problems on the line

S. Coene; F.C.R. Spieksma

doi:10.1016/j.orl.2007.11.001

Profit-based latency problems on the line

S. Coene, F.C.R. Spieksma

Research output: Contribution to journal › Article › Academic › peer-review

13 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	333-337
Journal	Operations Research Letters
Volume	36
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2007.11.001
Publication status	Published - May 2008
Externally published	Yes

Keywords

minimum latency
traveling repairman
dynamic programming
complexity

Access to Document

10.1016/j.orl.2007.11.001

Cite this

@article{48e0e7159e9e4cbfaa2d9088f9888c30,

title = "Profit-based latency problems on the line",

abstract = "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.",

keywords = "minimum latency, traveling repairman, dynamic programming, complexity",

author = "S. Coene and F.C.R. Spieksma",

year = "2008",

month = may,

doi = "10.1016/j.orl.2007.11.001",

language = "English",

volume = "36",

pages = "333--337",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Profit-based latency problems on the line

AU - Coene, S.

AU - Spieksma, F.C.R.

PY - 2008/5

Y1 - 2008/5

N2 - 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.

AB - 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.

KW - minimum latency

KW - traveling repairman

KW - dynamic programming

KW - complexity

U2 - 10.1016/j.orl.2007.11.001

DO - 10.1016/j.orl.2007.11.001

M3 - Article

SN - 0167-6377

VL - 36

SP - 333

EP - 337

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

Profit-based latency problems on the line

Abstract

Keywords

Access to Document

Fingerprint

Cite this