The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
Abstract. This paper describe the implementation and underlying philosophie of a large scale distributed computation of K-optimal lattice rules. The computation is huge correspondi...
The examination scheduling problem has been examined and a four-phase system using a tabu search algorithm, OTTABU, has been implemented. This system uses both recency-based short-...
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...