the complete structure of a { cal V} -covering of

{ cal V} -perfect

groups. Furthermore a necessary and sufficient conditions for the universality

of a { cal V} -central extension by a group and its { cal V} -covering group...

on the degree of cover colour of apple.

We have determined the time change of colouring and estimated it by means of environment variables. The results show significant relationships between the main meteorological variables, such as day and night...

In this talk, we discuss on the covering and immersion

of graphs. Based on some properties, we establish some results

about relation between immersion and covering. In particular, we

give some condition in which an immersion f...

Given n cities, the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes, i.e. the minimum length tour visiting a subset of the n cities and such that each city not on the tour is within a predetermined...

The Covering Salesman Problem (CSP) is to identify the minimum length tour of a subset of n given cities such that each city not on the tour is within a predetermined distance from the nodes on the tour. In this paper we define and develop a...

In this talk we are interested to focus on subgroups of topologized fundamental groups and some relationships between generalized covering subgroups and some famous subgroups of the fundamental group equipped with the compact-open topology....

Rapid and accurate estimation of Ground Cover -GC- at regional and global scales for

6 agricultural management application is only possible by using remote sensing -RS-. In

7 this paper, we used two Vegetation Indices -VIs- including...

In this paper we propose a new heuristic algorithm to solve the unicost version of the well-known set

covering problem. The method is based on the electromagnetism metaheuristic approach which, after

generating a pool of solutions...

In this paper we investigate a new method to solve the Unicost Set Covering

Problem. This method is based on the Electromagnetism Metaheuristic principles.

The algorithm first creates a group of solutions, then applies a fixed number...

using a heterogeneous and capacitated fleet of vehicles. We model this situation as a generalization of the covering tour problem by introducing the idea of split delivery, and we propose a heuristic approach to solve it. Numerical experiments on random...