An aggressive reduction scheme for the simple plant location problem

Pisinger et al. introduced the concept of ‘aggressive reduction’ for large‐scale combinatorial optimization problems. The idea is to spend much time and effort in reducing the size of the instance, in the hope that the reduced instance will then be small enough to be solved by an exact algorithm. We present an aggressive reduction scheme for the ‘Simple Plant Location Problem’, which is a classical problem arising in logistics. The scheme involves four different reduction rules, along with lower‐ and upper‐bounding procedures. The scheme turns out to be particularly effective for instances in which the facilities and clients correspond to points on the Euclidean plane.