Location-Arc Routing Problems (LARPs) are encountered in contexts where it is necessary to simultaneously determine a traversal of a subset of edges and arcs of a graph and to also locate facilities on the graph. The main LARP applications arise in the areas of postal delivery, garbage collection and road maintenance. This article surveys the main LARP applications and algorithms.