A local search approximation algorithm for the restricted universal facility location problem

dc.contributor.author	Kanodia U.; Shukla K.K.
dc.date.accessioned	2025-05-24T09:29:43Z
dc.description.abstract	This paper deals with a specialized universal facility location problem. In the general universal facility location problem, we are given a set of clients D and a set of facilities F, where each client has a certain demand, and each facility has a certain capacity. Each client has to be assigned to facilities from where it will be served. The additional restriction considered in this paper is that each client can fulfill only one unit of its demand from each facility. © 2016 IEEE.
dc.identifier.doi	https://doi.org/10.1109/ICDSE.2016.7823958
dc.identifier.uri	http://172.23.0.11:4000/handle/123456789/16231
dc.relation.ispartofseries	Proceedings of the 2016 International Conference on Data Science and Engineering, ICDSE 2016
dc.title	A local search approximation algorithm for the restricted universal facility location problem

Collections