This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...