The generalized discrete (r | p)-centroid problem

Abstract

The (r | p)-centroid problem or leader-follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized (r | Xp)-medianoid and (r | p)-centroid problems are presented and an exact solution approach is applied. Some computational examples are included.