Optimizing compatible sets in wireless networks through integer programming
In wireless networks, the notion of compatible set refers to a set of radio links that can be simultaneously active with a tolerable interference. Finding a compatible set with maximum weighted revenue from the parallel transmissions is an important optimization subproblem for resource management in...
Guardado en:
Autores principales: | Yuan Li, Michał Pióro, Di Yuan, Jinshu Su |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2014
|
Materias: | |
Acceso en línea: | https://doaj.org/article/dcc62528eed9485388b5aa60d571e9d7 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Solving wind farm layout optimization with mixed integer programs and constraint programs
por: PeterY. Zhang, et al.
Publicado: (2014) -
An exploratory computational analysis of dual degeneracy in mixed-integer programming
por: Gerald Gamrath, et al.
Publicado: (2020) -
Speeding up column generation for robust wireless network planning
por: Grit Claßen, et al.
Publicado: (2013) -
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
por: DimitriJ. Papageorgiou, et al.
Publicado: (2018) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017)