Jotshi, Arun; Batta, Rajan - In: European Journal of Operational Research 191 (2008) 2, pp. 347-359
We consider the problem of searching for a single, uniformly distributed immobile entity on an undirected network. This problem differs from edge-covering problems, e.g., the Chinese Postman Problem (CPP), since the objective here is not to find the minimum length tour that covers all the edges...