Article ID Journal Published Year Pages File Type
1142812 Operations Research Letters 2008 5 Pages PDF
Abstract

We consider a latency problem with a profit pipi for each client. When serving a client, a revenue of pi−tpi−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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Profit-based latency problems on the line
Authors
, ,