Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 35, Issue 2, Pages 356-372Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2006.03.003
Keywords
minimum coverage; anti-covering; distance constraint
Ask authors/readers for more resources
The objective is to locate undesirable facilities on a network so as to minimize the total demand covered subject to the condition that no two facilities are allowed to be closer than a pre-specified distance. We prove that there exists a dominating location set and that it is a challenging problem to determine the consistency of the distance constraints. We compare several different mathematical formulations to solve the problem. Heuristics with computational experiments are provided. (C) 2006 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available