Optimizing the minimum vertex guard set on simple polygons via a genetic algorithm

AL Bajuelos Domínguez, S Canales Cano… - … on Information Science …, 2008 - oa.upm.es
The problem of minimizing the number of vertex-guards necessary to cover a given simple
polygon (MINIMUM VERTEX GUARD (MVG) problem) is NP-hard. This computational …

Minimum vertex guard problem for orthogonal polygons: a genetic approach

The problem of minimizing the number of guards placed on vertices needed to guard a
given simple polygon (MINIMUM VERTEX GUARD problem) is NP-hard. This computational …

Metaheuristic approaches for the minimum vertex guard problem

AL Bajuelos, AM Martins, S Canales… - … and Applications in …, 2009 - ieeexplore.ieee.org
We address the problem of stationing guards in vertices of a simple polygon in such a way
that the whole polygon is guarded and the number of guards is minimum. This problem is …

Bayesian modelling volatility of growth rate in atmospheric carbon dioxide concentrations

E Amiri - … Conference on Environmental and Computer Science, 2009 - ieeexplore.ieee.org
Atmospheric gases, such as carbon dioxide, ozone, methane, nitrous oxide, and etc., create
a natural greenhouse effect and cause climate change. Therefore, modelling behavior of …

Geometric optimization on visibility problems: Metaheuristic and exact solutions

AM de Oliveira Martins - 2009 - search.proquest.com
Os problemas de visibilidade têm diversas aplicações a situações reais. Entre os mais
conhecidos, e exaustivamente estudados, estão os que envolvem os conceitos de vigilância …