Abstract
The Wireless Network Design Problem (WND) consists in choosing values of radio-electrical parameters of transmitters of a wireless network, to maximize network coverage. We present a pure 0-1 Linear Programming formulation for the WND that may contain an exponential number of constraints. Violated inequalities of this formulation are hard to separate both theoretically and in practice. However, a relevant subset of such inequalities can be separated more efficiently in practice and can be used to strengthen classical MILP formulations for the WND. Preliminary computational experience confirms the effectiveness of our new technique both in terms of quality of solutions found and provided bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrews, J.G., Ghosh, A., Muhamed, R.: Fundamentals of WiMAX. Prentice Hall, Upper Saddle River (2007)
Amaldi, E., Kann, V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theor. Comput. Sci. 147(1-2), 181–210 (1995)
D’Andreagiovanni, F., Mannino, C.: An Optimization Model for WiMAX Network Planning. In: Zhang, Y. (ed.) WiMAX Network Planning and Optimization, pp. 369–386. Auerbach Publications, Boca Raton (2009)
D’Andreagiovanni, F.: Pure 0-1 Programming Approaches to Wireless Network Design. Ph.D. Thesis, Sapienza Università di Roma, Rome, Italy (2010)
D’Andreagiovanni, F., Mannino, C., Sassano, A.: GUB Covers and Power-Indexed Formulations for Wireless Network Design. Technical Report vol. 2(14), Department of Computer and System Sciences, Sapienza Università di Roma, Rome, Italy (2010)
D’Andreagiovanni, F., Mannino, C., Sassano, A.: Separating Negative Cycle Inequalities (2010) (in preparation)
Kennington, J., Olinick, E., Rajan, D.: Wireless Network Design: Optimization Models and Solution Procedures. Springer, Heidelberg (2010)
Mannino, C., Mattia, S., Sassano, A.: Wireless Network Design by Shortest Path. Comp. Opt. and Appl. (2009), doi: 10.1007/s10589-009-9264-3
Nehmauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons, Hoboken (1988)
Pfetsch, M.: The Maximum Feasible Subsystem Problem and Vertex-Facet Incidence of Polyhedra. Ph.D. Thesis, Technische Universität Berlin, Berlin, Germany (2002)
Rappaport, T.S.: Wireless Communications: Principles and Practice, 2nd edn. Prentice Hall, Upper Saddle River (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D’Andreagiovanni, F., Mannino, C., Sassano, A. (2011). Negative Cycle Separation in Wireless Network Design. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21526-1
Online ISBN: 978-3-642-21527-8
eBook Packages: Computer ScienceComputer Science (R0)