We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

Most people will store smartphone waste or give it to others; this is due inadequate collection facilities in all cities/regencies Indonesia. In Yogyakarta Province, there no electronic facility. Therefore, an e-waste network needed cover potential the province of Yogyakarta. This study aims design a provide easy access for users, which includes number and location each center route transportin...

There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...

This paper presents a new method for determining efficient spatial distributions of police patrol areas. This method employs a traditional maximal covering formulation and an innovative backup covering formulation to provide alternative optimal solutions to police decision makers, and to address the lack of objective quantitative methods for police area design in the literature or in practice. ...

in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...

In this paper, we address the selfish bin covering problem, which is greatly related both to the bin covering problem, and to the weighted majority game. What we are mainly concerned with is howmuch the lack of central coordination harms social welfare. Besides the standard PoA and PoS, which are based on Nash equilibrium, we also take into account the strong Nash equilibrium, and several new e...

The strong isometric dimension and the adjacent isometric dimension of graphs are compared. The concepts are equivalent for graphs of diameter two in which case the problem of determining these dimensions can be reduced to a covering problem with complete bipartite graphs. Using this approach several exact strong and adjacent dimensions are computed (for instance of the Petersen graph) and a po...

We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on the method used. This is an improvement on the best known approximation factor of 108.

Given a direct sum G of cyclic groups, we find a sharp bound for the minimal number of proper subgroups whose union is G. This generalizes to sums of cyclic modules over more general rings, and we are able to solve this covering problem for all local, Artinian, or Dedekind rings (and even for monoids). We also minimally cover all finitely generated non-cyclic modules over quasi-local rings. The...