# The simple plant location problem: Survey and synthesis

@article{Krarup1983TheSP, title={The simple plant location problem: Survey and synthesis}, author={J. Krarup and P. Pruzan}, journal={European Journal of Operational Research}, year={1983}, volume={12}, pages={36-81} }

Abstract With emphasis on the simple plant location problem , (SPLP), we consider an important family of discrete, deterministic, single-criterion, NP-hard , and widely applicable optimization problems. The introductory discussion on problem formulation aspects is followed by the establishment of relationships between SPLP and set packing, set covering and set partitioning problems which all are among those structures in integer programming having the most wide-spread applications. An extensive… Expand

#### 548 Citations

Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience

- Computer Science
- Comput. Oper. Res.
- 2019

Branch and peg algorithms for the simple plant location problem

- Mathematics, Computer Science
- Comput. Oper. Res.
- 2003

The Uncapacitated Facility Location Problem: Some Applications in Scheduling and Routing

- Mathematics
- 2008

Upper and lower bounds for the two‐level simple plant location problem

- Mathematics, Computer Science
- Ann. Oper. Res.
- 1999

Valid inequalities and facets of the capacitated plant location problem

- Mathematics, Computer Science
- Math. Program.
- 1989

A New Formulation and Relaxation of the Simple Plant Location Problem

- Mathematics, Computer Science
- Asia Pac. J. Oper. Res.
- 2009

#### References

SHOWING 1-10 OF 82 REFERENCES

A direct dual method for the mixed plant location problem with some side constraints

- Computer Science, Mathematics
- Math. Program.
- 1979

Algorithms for the Simple Plant-Location Problem with Some Side Conditions

- Mathematics, Computer Science
- Oper. Res.
- 1969

Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem

- Mathematics, Computer Science
- Oper. Res.
- 1969

On the Set-Covering Problem: II. An Algorithm for Set Partitioning

- Mathematics, Computer Science
- Oper. Res.
- 1975