In this paper we propose two price-based job allocation schemes for computational grids. A grid system tries to solve problems submitted by various grid users by allocating the jo...
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
Piotr Jedrzejowicz, Ireneusz Czarnowski, Henryk Sz...
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...