A modified optimal algorithm for 2-maxian location problems on cactus graphs

Abstract

This paper considers the [Formula: see text]-maxian location problem on a cactus graph [Formula: see text] in which the aim is to find two points on [Formula: see text] for establishing obnoxious facilities such that the sum of weighted distances from all vertices (existing clients) to the farthest facility is maximized. We develop a modified algorithm for obtaining an optimal solution of the problem under investigation. The proposed algorithm is based on the generic solution idea by Kang et al., while it is straightforward and takes lower computational operations.