Speeding up column generation for robust wireless network planning
The wireless network planning problem consists of base station placement and traffic node assignment to base stations. To incorporate traffic demand uncertainties, we follow the Γ-robustness approach by Bertsimas and Sim. In this paper, we develop a branch-and-price algorithm, with the aim to enhanc...
Guardado en:
Autores principales: | Grit Claßen, Arie M.C.A. Koster, Anke Schmeink |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2013
|
Materias: | |
Acceso en línea: | https://doaj.org/article/6ac47a5f87ae4c67bb0c68d3c6e5b35b |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Special issue on: Computational discrete optimization
por: ArieM.C.A. Koster, et al.
Publicado: (2020) -
Bilevel programming for price-based electricity auctions: a revenue-constrained case
por: Ricardo Fernández-Blanco, et al.
Publicado: (2015) -
A robust basic cyclic scheduling problem
por: Idir Hamaz, et al.
Publicado: (2018) -
A MIP framework for non-convex uniform price day-ahead electricity auctions
por: Mehdi Madani, et al.
Publicado: (2017) -
Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
por: Christian Artigues, et al.
Publicado: (2018)