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...
Enregistré dans:
Auteurs principaux: | Grit Claßen, Arie M.C.A. Koster, Anke Schmeink |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Elsevier
2013
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/6ac47a5f87ae4c67bb0c68d3c6e5b35b |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Special issue on: Computational discrete optimization
par: ArieM.C.A. Koster, et autres
Publié: (2020) -
Bilevel programming for price-based electricity auctions: a revenue-constrained case
par: Ricardo Fernández-Blanco, et autres
Publié: (2015) -
A robust basic cyclic scheduling problem
par: Idir Hamaz, et autres
Publié: (2018) -
A MIP framework for non-convex uniform price day-ahead electricity auctions
par: Mehdi Madani, et autres
Publié: (2017) -
Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
par: Christian Artigues, et autres
Publié: (2018)