<Para ID="Par1">We consider fully discrete finite element approximations of a distributed optimal control problem, constrained by the evolutionary Stokes equations. Conforming finite element methods for spatial discretization combined with discontinuous time-stepping Galerkin schemes are being used for the...</para>

In this paper, we consider two decomposition schemes for the graph theoretical description of the axial Multidimensional Assignment Problem (MAP). The problem is defined as finding n disjoint cliques of size m with minimum total cost in K <Subscript> m×n </Subscript>, which is an m-partite graph with n elements per...</subscript>

We consider a variant of the multidimensional assignment problem (MAP) with decomposable costs in which the resulting optimal assignment is described as a set of disjoint stars. This problem arises in the context of multi-sensor multi-target tracking problems, where a set of measurements,...

By applying robust control the decision maker wants to make good decisions when his model is only a good approximation of the true one. Such decisions are said to be robust to model misspecification. In this paper it is shown that both a “probabilistically sophisticated” and a...