An aggressive reduction scheme for the simple plant location problem
The simple plant location problem is a classical problem in OR. We present an aggressive reduction scheme for it. The reduction procedures are based on optimality arguments and linear programming. Typically over 98% of the variables are eliminated. This enables larger instances than ever before to be solved to proven optimality.
facility location combinatorial optimization integer programming