Profit-based latency problems on the line

Authors:
Sofie Coene;Frits C. R. Spieksma
Affiliations:
Katholieke Universiteit Leuven, Operations Research Group, Naamsestraat 69, B-3000 Leuven, Belgium;Katholieke Universiteit Leuven, Operations Research Group, Naamsestraat 69, B-3000 Leuven, Belgium
Venue:
Operations Research Letters
Year:
2008

Citing 11
Cited 2

Routing and scheduling on a shoreline with release times

Management Science
The delivery man problem on a tree network

Annals of Operations Research
The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time algorithms for some minimum latency problems

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Minimum Latency Problem Is NP-Hard for Weighted Trees

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
Computer-Aided Complexity Classification of Dial-a-Ride Problems

INFORMS Journal on Computing
Traveling Salesman Problems with Profits

Transportation Science
Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Exact algorithms for the minimum latency problem

Information Processing Letters

Charlemagne's Challenge: The Periodic Latency Problem

Operations Research
Heuristics for the traveling repairman problem with profits

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.