Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

in this paper, we present the stochastic version of maximal covering location problem which optimizes both location and allocation decisions, concurrently. it’s assumed that traveling time between customers and distribution centers (dcs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to dc. in classical model...

This paper presents a simple, efficient algorithm to compute the covering graph of the lattice generated by a family B of subsets of a set X. The implementation of this algorithm has O((|X| + |B|) · |B|) time complexity per lattice element. This improves previous algorithms of Bordat (1986), Ganter and Kuznetsov (1998) and Jard et al. (1994). This algorithm can be used to compute the Galois (co...

In this paper, we study the restriction of an irreducible unitary representation π of the universal covering S̃p2n(R) to a Heisenberg maximal parabolic group P̃ . We prove that if π|P̃ is irreducible, then π must be a highest weight module or a lowest weight module. This is in sharp constrast with the GLn(R) case. In addition, we show that for a unitary highest or lowest weight module, π|P̃ decompo...