Profit-based latency problems on the line

We consider a latency problem with a profit p"i for each client. When serving a client, a revenue of p"i-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.

[1]  Marius M. Solomon,et al.  Routing and scheduling on a shoreline with release times , 1990 .

[2]  Jörg Rambau,et al.  Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models , 2006, Discret. Appl. Math..

[3]  Alfredo García Olaverri,et al.  A note on the traveling repairman problem , 2002, Networks.

[4]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[5]  Bang Ye Wu,et al.  Exact algorithms for the minimum latency problem , 2004, Inf. Process. Lett..

[6]  Han Hoogeveen,et al.  Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard , 2004, J. Sched..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  René Sitters,et al.  The Minimum Latency Problem Is NP-Hard for Weighted Trees , 2002, IPCO.

[9]  Jan Karel Lenstra,et al.  Computer-Aided Complexity Classification of Dial-a-Ride Problems , 2004, INFORMS J. Comput..

[10]  René Sitters,et al.  Complexity and approximation in routing and scheduling , 2004 .

[11]  George Papageorgiou,et al.  The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..

[12]  Bang Ye Wu,et al.  Polynomial time algorithms for some minimum latency problems , 2000, Inf. Process. Lett..

[13]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[14]  E. Minieka.  The delivery man problem on a tree network , 1990 .

[15]  Oded Berman,et al.  Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path , 1994, Transp. Sci..