An integer programming approach to the bandwidth packing problem
Management Science
Testing the Gaussian approximation of aggregate traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Bounds for probabilistic integer programming problems
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
The Probabilistic Set-Covering Problem
Operations Research
Telecommunication Network Capacity Design for Uncertain Demand
Computational Optimization and Applications
Provisioning virtual private networks under traffic uncertainty
Networks - Special Issue on Multicommodity Flows and Network Design
Convexity of chance constraints with independent random variables
Computational Optimization and Applications
A Sample Approximation Approach for Optimization with Probabilistic Constraints
SIAM Journal on Optimization
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
Discrete Applied Mathematics
MIP reformulations of the probabilistic set covering problem
Mathematical Programming: Series A and B
Solving chance-constrained combinatorial problems to optimality
Computational Optimization and Applications
Hi-index | 0.00 |
We show how we can linearize individual probabilistic linear constraints with binary variables when all coefficients are independently distributed according to either N(@m"i,@l@m"i), for some @l0 and @m"i0, or @C(k"i,@q) for some @q0 and k"i0. The constraint can also be linearized when the coefficients are independent and identically distributed and either positive or strictly stable random variables.