We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These heuristics are compared on a set of 152 real-life instances arising in cytological screening. 2002 Elsevier Science Ltd. All rights reserved.

We investigate multidimensional covering mechanism-design problems, wherein there are m items that need to be covered and n agents who provide covering objects, with each agent i having a private cost for the covering objects he provides. The goal is to select a set of covering objects of minimum total cost that together cover all the items. We focus on two representative covering problems: unc...

This paper considers the maximum coverage location problem (MCLP) in a continuous formulation. It is assumed that domain and family of geometric objects arbitrary shape are specified. necessary to find such cover greatest possible amount domain. A mathematical model MCLP proposed form an unconstrained nonlinear optimization problem. Python computational geometry packages were used calculate are...

Covering problems are well-studied in the domain of Operations Research, and, more specifically, Location Science. When location space is a network, most frequent assumption to consider candidate facility locations, points be covered, or both, finite sets. In this work, we study set-covering problem when both locations and demand continuous on network. This variant has received little attention...

in this paper, a robust model presented is developed for hub covering flow problem in which hubs have capacity. this problem has two objective functions converting to a single-objective problem by using weighting method. firstly, the problem will be formulated in a certain case. then, by considering the demand as a non-random variable, it will be modeled by robust optimization. finally, by usin...

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...