Stochastic programming problems with simple recourse belong to problems depending on a random element only through the corresponding probability measure. Consequently, this probability measure can be treated as a parameter of the problem. In this paper the stability with respect to the above mentioned parameter will be studied for generalized simple recourse problems.

This paper introduces two kinds of graph polynomials, clique polynomial and independent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned.

This paper reviews areas of active research in color image processing. Several open problems are mentioned and future directions for research are suggested.

Let T be a unit equilateral triangle, and T1, . . . , Tn be n equilateral triangles that cover T and satisfy the following two conditions: (i) Ti has side length ti (0 < ti < 1); (ii) Ti is placed with each side parallel to a side of T . We prove a conjecture of Zhang and Fan asserting that any covering that meets the above two conditions (i) and (ii) satisfies ∑n i=1 ti ≥ 2. We also show that ...

Evidence-based treatments and preventive interventions in the child and family area have not met with widespread adoption by practitioners. Despite the high prevalence of child behavioral and emotional problems, many parents and families in need are not receiving or participating in services, and when they do, the most efficacious interventions are not what is usually provided. Simultaneously a...

Article history: Received 15 April 2014 Received in revised form 29 September 2014 Accepted 28 October 2014 Available online 4 November 2014