Feasible region reduction cuts for the simple plant loction problem

The authors introduce a conceptually new method of generating strong cuts for the simple plant location problem. Based on the simple structure of the problem, they generate inequalities which even cut off part of the integer feasible region but still provide valid and sharp lower bounds of the problem when added to its linear programming relaxation. Also shown is the relation between such inequalities and the conventional valid inequalities of the problem.