论文信息 - A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks

A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks

In this paper, we propose a chance-constrained mathematical program for fixed broadband wireless networks under unreliable channel conditions. The model is reformulated as an integer linear program and valid inequalities are derived for the corresponding polytope. Computational results show that by an exact separation approach the optimality gap is closed by 42% on average.

[1] Harvey Lehpamer,et al. Microwave Transmission Networks : Planning, Design and Deployment , 2004 .

[2] Arie M. C. A. Koster,et al. Cutset Inequalities for Robust Network Design , 2011, INOC.

[3] Di Yuan,et al. An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing , 2004, Comput. Optim. Appl..

[4] Harry R. Anderson,et al. Fixed Broadband Wireless System Design: The Creation of Global Mobile Communications , 2003 .

[5] Tobias Achterberg,et al. The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs , 2010, Math. Program. Comput..

[6] Matteo Fischetti,et al. Just MIP it! , 2010, Matheuristics.

[7] Harry R. Anderson,et al. Fixed Broadband Wireless System Design: Anderson/Fixed , 2003 .

[8] Arie M. C. A. Koster,et al. On cut‐based inequalities for capacitated network design polyhedra , 2011, Networks.

[9] Harry R. Anderson,et al. Fixed Broadband Wireless System Design , 2003 .

[10] Hervé Rivano,et al. Power-efficient radio configuration in fixed broadband wireless networks , 2010, Comput. Commun..

[11] David Coudert,et al. Bandwidth assignment for reliable fixed broadband wireless networks , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.