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...
Saved in:
Main Authors: | Grit Claßen, Arie M.C.A. Koster, Anke Schmeink |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2013
|
Subjects: | |
Online Access: | https://doaj.org/article/6ac47a5f87ae4c67bb0c68d3c6e5b35b |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Special issue on: Computational discrete optimization
by: ArieM.C.A. Koster, et al.
Published: (2020) -
Bilevel programming for price-based electricity auctions: a revenue-constrained case
by: Ricardo Fernández-Blanco, et al.
Published: (2015) -
A robust basic cyclic scheduling problem
by: Idir Hamaz, et al.
Published: (2018) -
A MIP framework for non-convex uniform price day-ahead electricity auctions
by: Mehdi Madani, et al.
Published: (2017) -
Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
by: Christian Artigues, et al.
Published: (2018)