Optimization Online


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

Grit Claßen (classen***at***math2.rwth-aachen.de)
David Coudert (david.coudert***at***inria.fr)
Arie M. C. A. Koster (koster***at***math2.rwth-aachen.de)
Napoleão Nepomuceno (napoleao-vieira.nepomuceno***at***sophia.inria.fr)

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 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.

Keywords: chance-constraints, cutting planes, fixed broadband wireless networks, integer programming

Category 1: Integer Programming (Cutting Plane Approaches )

Category 2: Applications -- OR and Management Sciences (Telecommunications )

Category 3: Robust Optimization


Download: [PDF]

Entry Submitted: 03/04/2011
Entry Accepted: 03/04/2011
Entry Last Modified: 12/05/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society