Texto completo
Vista Previa |
PDF (Portable Document Format)
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (186kB) | Vista Previa |
Minimum Vertex Guard problem for orthogonal polygons: a genetic approach
Cita
Bajuelos Domínguez, Antonio Leslie, Hernández Peñalver, Gregorio 
ORCID: https://orcid.org/0000-0003-1165-0589, Canales Cano, Santiago and Martins, Ana Mafalda
(2008).
Minimum Vertex Guard problem for orthogonal polygons: a genetic approach.
En: "10th WSEAS International Conference on Mathematical Methods, Computational Techniques and Inteligent Systems, MAMECTIS '08", 26/10/2008-28/10/2008, Corfú, Grecia. ISBN 978-960-474-012-3.
ORCID: https://orcid.org/0000-0003-1165-0589, Canales Cano, Santiago and Martins, Ana Mafalda
(2008).
Minimum Vertex Guard problem for orthogonal polygons: a genetic approach.
En: "10th WSEAS International Conference on Mathematical Methods, Computational Techniques and Inteligent Systems, MAMECTIS '08", 26/10/2008-28/10/2008, Corfú, Grecia. ISBN 978-960-474-012-3.
Descripción
| Título: | Minimum Vertex Guard problem for orthogonal polygons: a genetic approach |
|---|---|
| Autor/es: |
|
| Tipo de Documento: | Ponencia en Congreso o Jornada (Artículo) |
| Título del Evento: | 10th WSEAS International Conference on Mathematical Methods, Computational Techniques and Inteligent Systems, MAMECTIS '08 |
| Fechas del Evento: | 26/10/2008-28/10/2008 |
| Lugar del Evento: | Corfú, Grecia |
| Título del Libro: | Proceedings of the 10th WSEAS International Conference on Mathematical Methods, Computational Techniques and Inteligent Systems, MAMECTIS '08 |
| Fecha: | 2008 |
| ISBN: | 978-960-474-012-3 |
| Materias: | |
| ODS: | |
| Palabras Clave Informales: | Art Gallery Problems, Orthogonal Polygons, Metaheuristics, Genetic Algorithms |
| Escuela: | Facultad de Informática (UPM) [antigua denominación] |
| Departamento: | Matemática Aplicada |
| Licencias Creative Commons: | Reconocimiento - Sin obra derivada - No comercial |
Resumen
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 complexity opens two lines of investigation: the development of algorithms that determine approximate solutions and the determination of optimal solutions for special classes of simple polygons. In this paper we follow the first line of investigation proposing an approximation algorithm based on the general met heuristic Genetic Algorithms to solve the MINIMUM VERTEXGUARD problem.
Más información
| ID de Registro: | 4599 |
|---|---|
| Identificador DC: | https://oa.upm.es/4599/ |
| Identificador OAI: | oai:oa.upm.es:4599 |
| URL Oficial: | http://www.wseas.org/conferences/2008/corfu/mamect... |
| Depositado por: | Memoria Investigacion |
| Depositado el: | 13 Oct 2010 10:38 |
| Ultima Modificación: | 20 Abr 2016 13:45 |
Acciones
- Estadísticas
- Exportar cita
- Editar (sólo personal del Archivo)
