Uniformly Deployed Sets in Computer Science and Optimisation

Uniformly deployed sets (UDS) are combinatorial objects that contain n-bit binary words of weight p as their elements and each pair of such words has at most t ones on the same positions (where t is a given natural number). In our contribution, we present a fast algorithm for the construction of UDS and we show some possibilities of their usage in various areas of computer science. For example, UDS can be used for increasing the effectiveness of heuristics in optimisation problems.