This paper considers a stochastic shortest path problem where the arc lengths are independent random variables following a normal distribution. In this problem, the optimal path is one that maximizes ...

The K-satisfability problem is a combinatorial discrete optimization problem, which for K=3 is NP-complete, and whose random formulation is of interest for understanding computational complexity ...

A random variable is one whose value is unknown or a function that assigns values to each of an experiment’s outcomes. A random variable can be discrete or continuous.

The importance of having improved bounds is illustrated through a non-linear programming problem with stochastic objective function, known as the "wait and see" problem.