Asignación de frecuencias en telefonía celular aplicando el problema de coloracion robusta
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....
Gorde:
| Egile Nagusiak: | , , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Universidad de Costa Rica
2010-04-01
|
| Saila: | Revista de Matemática: Teoría y Aplicaciones |
| Sarrera elektronikoa: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/303 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|