COMBINATORIAL ALGORITHMS- TRAVELLING SALESMAN PROBLEM AND SCHEDULING CPU PROCESSES

Abstract

The travelling salesman problem is one of the problems called combinatorial optimization problems. This is one is one of the most studied optimization problems, and its solutions and applications will be described in this paper. On the other hand, scheduling a process in a processor is the task in which the process is selected from the queue to which processor is assigned after that (by dispatcher). There are several different algorithms for selecting the process to be executed, and most significant will be described.