Combinatorial and Scheduling Problems: One class of problems is concerned with specifying optimal scheduled. A classical example is the Travelling Salesperson Problem where the problem is to find a minimum distance tour starting at one of the several cities visiting other cities only once and then returning back to the starting city.