In this paper we provide a mathematical optimization based framework to determine the location of leak detection devices along a network. Assuming that the devices are endowed with a given coverage area, we analyze two different models. The first model aims to minimize the number of devices to be located in order to (fully or partially) cover the volume of the network. In the second model, the number of devices is given, and the goal is to locate them to provide maximal volume coverage. In our models it is not assumed that the devices are located in the network (nodes or edges) but in the entire space, which allow to more flexible coverage. We report the results of applying our models to real-world water supply pipeline urban network, supporting the validity of our models.