Comments on: Static and dynamic source locations in undirected networks

Abstract

The paper under discussion deals with the static and dynamic source location problem in the form of covering problems. It is an integrated facility location and maximum flow problem where the aim is to determine the number and the positions of the uncapacitated facilities (referred to as sources) which minimize the overall location (installation) costs, guaranteeing that the maximum flow between the located facilities and any other vertex of the network is at least as large as the vertex demand. Hence this problem is referred to in literature as a FlowLoc problem.The authors classify the literature about this problem with reference to several issues. In particular, they focus on:-Static and dynamic networks; -Single and plural vertex demand coverage; -Simultaneous and non-simultaneous demand coverage; -Uniform and non-uniform node parameters (vertex demands and location costs); -Single and multi-commodity flows.It is easy to understand that several problem variants, with different complexity, can be obtained by different combinations of them.The authors focus on the single-commodity flow problems, discussing, for several variants of it, their complexity (in dependence also of the network topology), surveying This comment refers to the invited paper available at