Given a set of elements, each having a profit and cost associated with it, and a budget, the 0-1 knapsack problem finds a subset of the elements with maximum possible combined profit subject to the combined cost not exceeding the budget. In this paper we study a stochastic version of the problem...

The thesis provides an algorithmic approach to the scheduling problem for call centre agents. It shows that this problem is NP-complete and even inapproximable. A broad statistical analysis of call data from a call centre is contained, too.

Though the envelope theorem is a widely used tool of applied economic analysis, the standard version of the theorem can only be used if all of the choice variables are assumed to be continuous. This limitation is significant because the natural description of many economic choice variables is as...