Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
This paper builds a new theoretical connection between singular control of finite variation and optimal switching problems. This correspondence provides a novel method for solving ...
In this paper we present a framework in which the general hybrid filtering or state estimation problem can be formulated. The problem of joint tracking and classification can be f...
In this paper we provide a general classification of mathematical optimization problems, followed by a matrix of applications that shows the areas in which these problems have bee...
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...