Asignación de frecuencias en telefonía celular aplicando el problema de coloración robusta
Saved in:
| Authors: | , , , |
|---|---|
| Format: | artículo original |
| Status: | Versión publicada |
| Publication Date: | 2009 |
| Description: | The Robust Coloring Problem (RCP) is a NP-Hard Problem for which fast and efficient heuristic algorithms has been developed. In this work we present as a PCR the problem of assignment of frequencies for a cellphone grid. Some instances for this model are proposed and solved using a GRASP algorithm. Evidence shows that the intermittent interruptions in service can be eliminated and the overall capacity can be increased in approximately 25%. |
| Country: | Portal de Revistas UCR |
| Institution: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Language: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/303 |
| Online Access: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/303 |
| Keyword: | Graph coloring Robust coloring problem Heuristics GRASP Coloración de gráficas Coloración Robusta Heurísticas |