## A simple and effective metaheuristic for the Minimum Latency Problem

- Marcos Melo Silva, Anand Subramanian, Thibaut Vidal, Luiz Satoru Ochi
- European Journal of Operational Research
- 2012

Highly Influenced

@inproceedings{Archer2010ImprovedAA, title={Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls}, author={Aaron Archer and Anna Blasiak}, booktitle={SODA}, year={2010} }

- Published 2010 in SODA
DOI:10.1137/1.9781611973075.36

The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the clients experience prior to being served, rather than the total latency experienced by the server (as in the TSP). The MLP sometimes goes by other names, such as the traveling repairman problem, or the deliveryman problem. Unlike most combinatorial optimization problems, the MLP is NP-hard even on trees (Sitters, 2001… CONTINUE READING

Showing 1-6 of 6 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential