@inproceedings{AreMouAbd01a,
        author = "S. Areibi and M. Moussa and H. Abdullah",
        title = "A comparison of genetic/memetic algorithms and other 
		heuristic search techniques",
        booktitle = "Proceedings of IC-AI 2001",
        city = "Las Vegas, nevada, USA",
        month = "July 25",
        year = "2001",
	annote = "The authors compare in this paper several 
		constructive procedures for circuit partitioning problems, 
		including a genetic algorithm, a memetic algorithm, and 
		a {GRASP}."
}

@incollection{AreVan97a,
	author = "S. Areibi and A. Vannelli",
	title = "A {GRASP} clustering technique for circuit partitioning",
 	booktitle = "Satisfiability problems",
        editor = "J. Gu and P.M. Pardalos",
        series = "{DIMACS} Series on Discrete Mathematics and Theoretical
                  Computer Science",
  	publisher = "American Mathematical Society",
        volume = "35",
        pages = "711--724",
	year = "1997",
        annote =	"This paper adapts a basic node interchange scheme
                	for solving the circuit partitioning problem and 
			develops a clustering technique that uses {GRASP} to 
			generate clusters of moderate sizes. 
			The number of clusters is predetermined as a function 
			of the number of partitions required. Initially,
                	the heuristic reads the circuit description and resizes
                	the blocks to be used by {GRASP}, which utilizes only 
			the construction phase to generate the number of
                	required clusters.
                	The {GRASP} construction phase is followed by
                	a post-processing stage, in which a simple dynamic
                	hill climbing algorithm is used as local
                	search to improve the initial solution generated."
}

@inproceedings{AreVan00a,
	author = {S. Areibi and A. Vannelli}, 
	title = {Efficient Hybrid Search Techniques For Circuit Partitioning},
	booktitle = {{IEEE 4th World Multiconference on Circuits, Systems,
                   Communications \& Computers}},
	city = {Athens, Greece},
	month = {July},
	year = {2000},
	annote = "In this paper, for solving the problem 
		the authors apply a simulated annealing, a tabu 
		search, a {GRASP}, and a genetic algorithm. 
		Two further search techniques are also proposed as hybrids, 
		where a {GRASP} and a genetic algorithm are used for 
		generating good initial partitions."
}

@inproceedings{Are99a,
	author = "S.M. Areibi",
	title = "{GRASP}: {A}n effective constructive technique for
		 {VLSI} circuit partitioning",
	booktitle = "Proc. IEEE Canadian Conference on Electrical
	              \& Computer Engineering (CCECE'99)",
        city="Edmonton, Alberta, Canada",
        month = "May",
	year = "1999",
        volume = {1},
	pages = {462--467},
        annote =        "This article proposes a {GRASP} for obtaining good 
			initial solutions for an iterative improvement 
			technique.
                	At each iteration of the randomized
                	approach, the gains associated with moving modules 
			to the current block being filled are examined, 
			and a restricted candidate list is built using 
			the modules with the highest gains."
}