@thesis{thesis,
		author={Setiawan  Budhi},
		title ={PERBANDINGAN DAN IMPLEMENTASI ALGORITMA SEMT DAN ALGORTIMA HUNGARIAN UNUTK MENYELESAIKAN QUADRATIC ASSIGNMENT PROBLEM (QAP)},
		year={2007},
		url={https://repository.unikom.ac.id/10461/},
		abstract={Minimum cost search is a problem that always seen in production. This     
 
 
 

minimum cost search has connection with scheduling problem. With good     
 
 
 

scheduling so that would result an assignment which resulting small cost.     
 
 
 

There are two algorithms that can be useful for solving this assignment     
 
 
 

problem. There is Ant Colony Algorithm and Hungarian Algorithm that     
 
 
 

represented probabilistic model and deterministic model.     
 
 
 

For Ant Colony Algorithm, the minimum cost searching system was adapted     
 
 
 

from ant life activities to find their food. And Hungarian Algorithm, the searching     
 
 
 

system was doing with using arithmetic process in matrix.}
		}