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
The double-assignment plant location problem with co-location
Branch and peg algorithms for the simple plant location problem
The Uncapacitated Facility Location Problem: Some Applications in Scheduling and Routing
Upper and lower bounds for the two‐level simple plant location problem
Valid inequalities and facets of the capacitated plant location problem
A New Formulation and Relaxation of the Simple Plant Location Problem
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 82 REFERENCES
...
1
2
3
4
5
...