In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
We develop a sequential sampling procedure for solving a class of stochastic programs. A sequence of feasible solutions, with at least one optimal limit point, is given as input t...
In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a genera...