# The Online Multi-Commodity Facility Location Problem

@article{Castenow2020TheOM, title={The Online Multi-Commodity Facility Location Problem}, author={Jannik Castenow and Bjorn Feldkord and Till Knollmann and Manuel Malatyali and F. M. A. D. Heide}, journal={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, year={2020} }

We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set (S) of commodities. Ravi and Sinha (SODA 2004) introduced the model as the Multi-Commodity Facility Location Problem (MFLP) and considered it an offline optimization problem. The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-4 OF 4 REFERENCES