We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > An aggressive reduction scheme for the simple p...
View graph of relations

« Back

An aggressive reduction scheme for the simple plant location problem

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>1/05/2014
<mark>Journal</mark>European Journal of Operational Research
Number of pages9
Early online date18/10/13
<mark>Original language</mark>English


Pisinger et al. introduced the concept of 'aggressive reduction' for large-scale combinatorial optimisation 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.

Bibliographic note

The final, definitive version of this article has been published in the Journal, European Journal of Operational Research 234 (3), 2014, © ELSEVIER.