A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem

Mostrar todas las versiones(3)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Delle Donne, D., Marenco, J.
Formato: Artículo publishedVersion
Lenguaje:Inglés
Publicado: 2011
Materias:
Adjacent colors
Frequency assignment
Integer programming
Adjacent channels
Branch-and-cut algorithms
Computational results
Frequency assignments
Frequency channels
Integer programming models
Interference graphs
Potential interferences
Valid inequality
Vertex coloring
Vertex coloring problems
Wireless communication network
Algorithms
Antennas
Cochannel interference
Combinatorial optimization
Computer programming
Graph theory
Wireless networks
Wireless telecommunication systems
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_15725286_v8_n4_p540_DelleDonne
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares