In this article, we consider the set covering problem with conflict constraints, i.e., from each conflicting pair of columns at most one column can appear in feasible solution. For problem, propose appropriate pre-processing techniques and several families Valid Inequalities (VIs) for corresponding integer programming model that result simultaneous presence constraints stable (conflict) constra...

In this paper we address the problem of covering narrow indoor or outdoor pathways using a network of mobile Cyclops cameras. We propose and validate a 1D sensingperformance model for the detection behavior of the camera. Based on this, we formulate the covering problem as a new type of 1D locational optimization problem that explicitly accounts for the camera-location dependence of the sensing...

Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...

Let X̃ be a connected space, X be a space, let p : X̃ −→ X be a continuous map and let (X̃, p) be a covering space of X . In the first section we give some preliminaries from covering spaces and their automorphism groups. In the second section we derive some algebraic properties of both universal and regular covering spaces (X̃, p) of X and also their automorphism groups A(X̃, p). Keywords—covering ...