Comments on the paper: 'Heuristic and Special Case Algorithms for Dispersion Problems' by S.S. Ravi, D.J. Rosenkrantz, and G.K. Tayi

Some of the views of S.S. Ravi, D.J. Rosenkrantz and G.K. Tayi regarding algorithms for facility dispersion models are flawed. They provided a Max-Min Facility Dispersion (MMFD) with a performance guarantee of 50% and a Max-Average Facility Dispersion (MAFD) with a 25% performance rate. The heuristic of the MMFD was depicted as more of a general model than what was analyzed in 1991. They also supported the MMFD with the lowest complexity bound in a study conducted by D.W. Wang and Y.S. Kuo in 1988. Moreover, the MAFD was associated with a dynamic programming algorithm considered as a trivial optimal solution. The extension of the one-dimensional version of MAFD to tree networks can also be solved through an approach made in 1991.