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 …
被引用次数：15 相关文章
[PDF] researchgate.net

[PDF][PDF] Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm

AL BAJUELOS, S CANALES, G HERNÁNDEZ… - researchgate.net
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 …
[PDF] academia.edu

[PDF][PDF] Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm

AL BAJUELOS, S CANALES, G HERNÁNDEZ… - academia.edu
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 …
[PDF] core.ac.uk

[PDF][PDF] Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm

AL BAJUELOS, S CANALES, G HERNÁNDEZ… - core.ac.uk
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 …
[PDF] psu.edu

[PDF][PDF] Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm

AL BAJUELOS, S CANALES, G HERNÁNDEZ… - Citeseer
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 …
[PDF] wseas.us

[PDF][PDF] Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm

AL BAJUELOS, S CANALES, G HERNÁNDEZ… - wseas.us
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 …
[PDF] upm.es

[PDF][PDF] Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm

AL BAJUELOS, S CANALES, G HERNÁNDEZ… - 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 …
[PDF] academia.edu

[PDF][PDF] Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm

AL BAJUELOS, S CANALES, G HERNÁNDEZ… - academia.edu
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 …
[PDF] researchgate.net

[PDF][PDF] Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm

AL BAJUELOS, S CANALES, G HERNÁNDEZ… - researchgate.net
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 …