We consider the production/inventory control for a recoverable system with stochastic demand and returns where stock is replenished by manufacturing new items or remanufacturing returned items. The optimal control policy found by solving a Markov decision process (MDP) for a given problem...

Let P be an undirected path graph of n vertices. Each edge of P has a positive length and a constant capacity. Every vertex has a nonnegative supply, which is an unknown value but is known to be in a given interval. The goal is to find a point on P to build a facility and move all vertex...

In this paper a discrete optimization problem under uncertainty is discussed. Solving such a problem can be seen as a game against nature. In order to choose a solution, the minmax and minmax regret criteria can be applied. In this paper an extension of the known minmax (regret) approach is...

This paper analyses the problem of finding a robust spanning tree. The problem consists of determining a minimum spanning tree of a graph with uncertain edge costs. We should determine a spanning tree that minimizes the difference in costs between the tree selected and the optimal tree. While...