@Article{BahOliPer01a,
	author = "L. Bahiense and G.C. Oliveira and M. Pereira",
	title = "A mixed integer disjunctive model for transmission
		network expansion",
	journal = "IEEE Transactions on Power
		Systems",
	volume = "16",
	pages = "560--565",
	year = "2001",
        annote   =     "Given the nonconvex nature of the transmission 
			network expansion problem, its classical nonlinear 
			mixed integer formulation does not guarantee an 
			optimal solution. 
			Hence, the authors of this paper propose an 
			alternative mixed integer linear disjunctive 
			formulation. 
			The mixed integer program is solved by a commercial 
			branch and bound code, where the upper bound in the 
			bounding phase is obtained by applying the reactive 
			{GRASP} proposed in Binato et al. (2001).",
}

@incollection{BinOli02a,
	author = "S. Binato and G.C. Oliveira",
	title = "A {Reactive GRASP} for transmission network expansion
	         planning",
        booktitle = "Essays and surveys in metaheuristics",
        editor = "C.C.  Ribeiro and P.  Hansen",
	publisher = "Kluwer Academic Publishers",
        year = "2002",
	pages = "81--100",
        annote = 	"The {GRASP} previously proposed by Binato, Oliveira, 
			and Ara\'ujo (1998) for solving a transmission network 
			expansion problem is enhanced with the reactive scheme 
			of Prais and Ribeiro (2000) to self-adjust the
                	{GRASP} RCL parameter $\alpha$. 
			They also propose to apply
                	a bias distribution function of Bresina (1996) to bias
                	the random greedy construction phase towards the most 
			promising variables."
}

@Article{BinOliAra01a,
        author = "S. Binato and G.C. Oliveira and J.L. Ara\'ujo",
        title = "A greedy randomized adaptive search procedure for
                 transmission expansion planning",
        journal = "IEEE Transactions on Power Systems",
        volume = "16",
        pages = "247--253",
        year = "2001",
        annote   =     "This paper presents a {GRASP} for a
                	long term transmission expansion planning problem. The
                	greedy function is to minimize the load curtailment required
                	to eliminate all operational violations. The local search
                	phase is based on circuit exchanges, i.e. the procedure
                	exchanges selected additions with unselected additions.",
}

@Article{ViaSouMat03a,
       	author = {A. Viana and J.P. de~Sousa and M. Matos},
       	title = {{Using GRASP to solve the unit commitment problem}},
       	journal = {Annals of Operations Research},
       	volume = {120},
       	pages = {117--132},
	annote = {The unit commitment problem consists in deciding, 
		over a given planning horizon, the set of electric 
		generators to be commited and defining the production 
		levels required for each generator so that load and 
		spinning reserve requirements are verified at a minimum 
		production cost. 
		The {GRASP} construction phase proposed applies a 
		greedy criterion based on fuel cost, start-up cost, 
		and shut-down cost. 
		The local search procedure uses a $1$-flip neighborhood, 
		where neighbors of a given solution are obtained 
		by changing the current status of a single unit.},
       	year = {2003}
}

@techreport{VogFloLan02a,
        author = "I. Vogel and M.-L. Flottes and C. Landrault",
        title = "Initialisation des circuits s\'equentiels avant test 
		int\'egr\'e et scan partiel",
        institution = "Laboratoire d'Informatique, de Robotique et de 
		       Micro-\'electronique de Montpellier",
        address = "Montpellier, France",
	annote = "In this paper, the {GRASP} proposed by Pardalos, Qian, 
		and Resende for the feedback set problem is applied for 
		solving the sequential circuits initialization problem. 
		In French.",
        year = "2002"
}