A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
In this work we study a particular way of dealing with interference in combinatorial optimization models representing wireless communication networks. In a typical wireless network, co-channel interference occurs whenever two overlapping antennas use the same frequency channel, and a less critical i...
Guardado en:
| Autores principales: | , |
|---|---|
| Publicado: |
2011
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15725286_v8_n4_p540_DelleDonne http://hdl.handle.net/20.500.12110/paper_15725286_v8_n4_p540_DelleDonne |
| Aporte de: |