Abstract
This is a summary of the author’s PhD thesis, supervised by Edoardo Amaldi and defended on 28 April 2006 at Politecnico di Milano, Dipartimento di Matematica. The thesis is written in English and is available from the author upon request. The thesis investigates a class of nonlinear set covering variants arising from the problem of designing single-frequency Wireless Local Area Networks (WLANs) with maximum efficiency. In the first part of the thesis a basic hyperbolic formulation of the problem is considered. After a complexity and approximability study, the problem is tackled by linearization techniques, and by Lagrangean and Dantzig–Wolfe decompositions. The second part of the thesis focuses on variants accounting for various relevant features of the WLAN application. A Branch-and-Price algorithm is presented, and extensions to the multiple-frequency WLAN design problem are considered.
Similar content being viewed by others
References
Ceria S, Nobili P, Sassano A (1997) Set covering problem. In: Dell’Amico M, Maffioli F, Martello S (eds) Annotated bibliographies in combinatorial optimization. Wiley, New York
Hansen P, Poggi de Aragão M, Ribeiro C (1990) Boolean query optimization and the 0-1 hyperbolic sum problem. Ann Math Artif Intell 1:97–109
Hills A (2001) Large-scale Wireless LAN design. IEEE Commun Magaz 39:98–107
Tawarmalani M, Ahmed S, Sahinidis NV (2002) Global optimization of 0-1 hyperbolic programs. J Global Optim 24:385–416
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bosio, S. On a new class of nonlinear set covering problems arising in wireless network design. 4OR 6, 183–186 (2008). https://doi.org/10.1007/s10288-007-0052-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-007-0052-6