The deterministic and stochastic versions of the resource allocation problem have already been discussed in the literature. The goal of this contribution is to formulate optimization models applicable to the problem of resource allocation under uncertainty, which signifies that profits resulting...

One of the most known combinatorial problem is a Travelling Salesman Problem. In this paper a extended version is considered – multisalesman problem, which is known in the literature as a vehicle routing problem. It is very easy to define this NP-hard problem, but to find a optimal solution is...