Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with...
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
In this paper we consider the problem of locating a small three-dimensional elastic inclusion, using arrays of elastic source transmitters and receivers. This procedure yields the ...
We study the quantitative stability of linear multistage stochastic programs under perturbations of the underlying stochastic processes. It is shown that the optimal values behave...
The Landweber method is a simple and flexible iterative regularization algorithm, whose projected variant provides nonnegative image reconstructions. Since the method is usually v...
Paola Brianzi, Fabio Di Benedetto, Claudio Estatic...