Skip to main content

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

  • Conference paper
Network Optimization (INOC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6701))

Included in the following conference series:

  • 3422 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Achterberg, T., Raack, C.: The MCF-separator: detecting and exploiting multi-commodity flow structures in MIPs. Mathematical Programming Computation 2, 125–165 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Anderson, H.: Fixed Broadband Wireless System Design, 1st edn. John Wiley & Sons, Chichester (2003)

    Book  Google Scholar 

  3. Claßen, G., Coudert, D., Koster, A., Nepomuceno, N.: Bandwidth assignment for reliable fixed broadband wireless networks. In: IEEE WoWMoM 2011. IEEE, Lucca (2011)

    Google Scholar 

  4. Coudert, D., Nepomuceno, N., Rivano, H.: Power-efficient radio configuration in fixed broadband wireless networks. Computer Communications 33(8), 898–906 (2010)

    Article  Google Scholar 

  5. Fischetti, M., Lodi, A., Salvagnin, D.: Just MIP it! Ann. Info. Systems 10, 39–70 (2009)

    Article  Google Scholar 

  6. IBM – ILOG: CPLEX Optimization Studio 12.2, http://www.ilog.com/products/cplex

  7. Koster, A.M.C.A., Kutschka, M., Raack, C.: Cutset inequalities for robust network design. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011, 128–133. LNCS, vol. 6701, Springer, Heidelberg (2011)

    Google Scholar 

  8. Larsson, T., Yuan, D.: An augmented lagrangian algorithm for large scale multicommodity routing. Computational Optimization and Applications 27(2), 187–215 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lehpamer, H.: Microwave transmission networks: planning, design, and deployment. McGraw-Hill, New York (2010)

    Google Scholar 

  10. Raack, C., Koster, A.M.C.A., Orlowski, S., Wessäly, R.: On cut-based inequalities for capacitated network design polyhedra. Networks 57, 141–156 (2011)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Claßen, G., Coudert, D., Koster, A.M.C.A., Nepomuceno, N. (2011). A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks. 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_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21527-8_5

  • 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)

Publish with us

Policies and ethics