The maximal covering location problem (MCLP) deals with the problem of finding an optimal
placement of a given number of facilities within a set of customers. Each customer has a …

We introduce the board packing problem (BoPP). In this problem we are given a rectangular
board with a given number of rows and columns. Each position of the board has an integer …

We investigate three kinds of optimization problems regarding n points in the 2-dimensional
plane that need to be enclosed by squares.(1) Find a given number of squares that enclose …

Let P be the point set in two dimensional plane. In this paper, we consider the problem of
locating two isothetic unit squares such that together they cover maximum number of points …

We introduce the board packing problem, defined on a rectangular board to be partially
covered by a set of rectangles. The board corresponds to some physical area where we can …

We investigate two kinds of optimization problems regarding points in the 2-dimensional
plane that need to be enclosed by squares.(1) Given a set of n points, find a given number of …

In this paper, we consider the discrete unit square cover (DUSC) problem as follows: given a
set 𝒫 of n points and a set 𝒮 of m axis-aligned unit squares in ℝ 2, the objective is (i) to …

Given a set P of n objects in two dimensional plane and a positive integer k (≤ n), we have
considered the problem of partitioning P into k clusters of circular shape so as to minimize …

Given a set P of n points in two dimensional plane. In this paper we study the minimum
enclosing square problem. First an O (n log 2 n) time and linear space algorithm is proposed …

Motivated by the applications in facility location VLSI design image processing and motion
planning geometric covering problems have been studied extensively in the literature In this …