Profit-earning facility location
- 6 July 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
We consider opening facilities in order to gain a profit. We are given a set of demand points, and we must open some set of facilities such that every demand may be satisfied from a local facility and the total profit gained in this process is maximized. This contrasts with previous work on facility location and k-center problems, where opening a facility incurred a cost. The profit gained by opening a facility is a function of the amount of demand the facility satisfies. We model the dependence of profit on demand by creating many different possible facilities at each location, each of which provides a certain profit if opened and requires at least a certain amount of demand in order to open. Our model captures problem instances where profits may be positive or negative, and also instances where it is not necessary to satisfy every demand. Our algorithms provide the optimum total profit, while stretching the definition of locality by a constant and violating the required demands by a constant. We prove that without this stretch, the problem becomes NP-Hard to approximate.Keywords
This publication has 5 references indexed in Scilit:
- A constant-factor approximation algorithm for the k -median problem (extended abstract)Published by Association for Computing Machinery (ACM) ,1999
- Approximation algorithms for facility location problems (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- An approximation algorithm for the generalized assignment problemMathematical Programming, 1993
- e-approximations with minimum packing constraint violation (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- A Best Possible Heuristic for the k-Center ProblemMathematics of Operations Research, 1985