In this study, we review the covering problems in facility location. Here, besides a number of
reviews on covering problems, a comprehensive review of models, solutions and …

Chance-constrained programming (CCP) is one of the most difficult classes of optimization
problems that has attracted the attention of researchers since the 1950s. In this survey, we …

We study approximations of optimization problems with probabilistic constraints in which the
original distribution of the underlying random vector is replaced with an empirical distribution …

Astochastic, mixed-integer program (MIP) involving joint chance constraints is developed
that generates least-cost vehicle redistribution plans for shared-vehicle systems such that a …

We present a new approach for exactly solving chance-constrained mathematical programs
having discrete distributions with finite support and random polyhedral constraints. Such …

This paper provides an introduction to algorithms for two-stage stochastic mixed-integer
programs. Our focus is on methods that decompose the problem by scenarios representing …

We study a class of chance-constrained two-stage stochastic optimization problems where
second-stage feasible recourse decisions incur additional cost. In addition, we propose a …

The mixing set with a knapsack constraint arises in deterministic equivalent of chance-
constrained programming problems with finite discrete distributions. We first consider the …

We consider a class of packing problems with uncertain data, which we refer to as the
chance-constrained binary packing problem. In this problem, a subset of items is selected …

The set covering problem (SCP) is a fundamental NP-hard problem in computer science and
has a broad range of important real-world applications. In practice, SCP instances …