@incollection{AndCarRib98a,
        author = "A.A. Andreatta and S.E.R. Carvalho and C.C. Ribeiro",
        title = "An object-oriented framework for local search heuristics",
        booktitle = "Proceedings of the 26th TOOLS USA '98 -- 
		    {T}echnology of {O}bject-{O}riented {L}anguages and 
		    {S}ystems",
        publisher = "IEEE Computer Society",
        year = "1998",
        pages = "33--45",
        annote = "This paper proposes a unified object-oriented
                framework for comparing in a systematic way
                strategies and parameters of different heuristics
                designed for solving the same combinatorial
                optimization problem."
}

@incollection{AndCarRib02a,
        author = "A.A. Andreatta and S.E.R. Carvalho and C.C. Ribeiro",
        title = "A framework for the development of local search 
		heuristics for combinatorial optimization problems",
        booktitle = "Optimization Software Class Libraries",
        editor = "S. Voss and D. Woodruff",
        publisher = "Kluwer Academic Publishers",
        pages = "59--79",
        year = "2002",
	annote = "Main goal of this paper is to provide an architectural 
		basis both for the implementation and for the comparison 
		of different local search heuristics. 
		Through the use of abstract classes, the proposed 
		framework incapsulates different aspects usually involved in 
		local searches, such as methods for constructing an 
		initial feasible solution, for generating a suitable 
		neighborhood, and for choosing the suitable movement 
		selection criteria."
}

@Article{FesParRes01a,
	author = "P. Festa and P.M. Pardalos and M.G.C. Resende",
	title = "Algorithm 815: {FORTRAN} Subroutines for 
		 Computing Approximate Solution to Feedback Set 
		 Problems using {GRASP}",
	journal = "ACM Transactions on Mathematical Software",
	volume = "27",
	pages = "456--464",
	year = "2001",
        annote   =     "A set of ANSI standard Fortran 77 subroutines
                	for approximately solving the
                	feedback vertex and arc set problems is described.",
}

@Article{ParPitRes97a,
	author = "P.M. Pardalos and L.S. Pitsoulis and M.G.C. Resende",
	title = "Algorithm 769: {F}ortran subroutines for approximate
		 solution of
		 sparse quadratic assignment problems using {GRASP}",
	journal = "ACM Transactions on Mathematical Software",
	volume = "23",
	pages = "196--208",
	year = "1997",
        annote   =     "A version of the {GRASP}
                	for the quadratic assignment problem of Li, Pardalos,
                	and Resende (1994), tailored for sparse instances
                	is proposed.
                	A set of ANSI standard Fortran 77 subroutines are i
			described.",
}

@Article{ResParLi96a,
	author = "M.G.C. Resende and P.M. Pardalos and Y. Li",
	title = "Algorithm 754: {F}ortran subroutines for approximate
		 solution of
		 dense quadratic assignment problems using {GRASP}",
	journal = "ACM Transactions on Mathematical Software",
	volume = "22",
	pages = "104--118",
	year = "1996",
        annote   =     "This paper describes a set of ANSI standard Fortran 77
                	subroutines to find approximate solutions to dense
                	quadratic assignment problems having at least one
                	symmetric flow or distance matrix. It is an
                	optimized implementation
                	of the algorithm described in Li, Pardalos, and 
			Resende (1994).",
}

@Article{ResFeoSmi98a,
	author = "M.G.C. Resende and T.A. Feo and S.H. Smith",
	title = "Algorithm 787: {Fortran} subroutines for
		 approximate solution of
		 maximum independent set problems using {GRASP}",
	journal = "ACM Transactions on Mathematical Software",
	year = "1998",
	volume = "24",
	pages = "386--394",
        annote   =     "This article describes a set of ANSI standard Fortran 77
                	subroutines to find an approximate solution of a maximum
                	independent set problem. The {GRASP} used to produce the
                	solutions is described in Feo, Resende, and 
			Smith (1994).",
}

@Article{ResPitPar00a,
	author = "M.G.C. Resende and L.S. Pitsoulis and P.M. Pardalos",
	title = "{Fortran} subroutines for computing
		 approximate solutions of
		 {MAX-SAT} problems using {GRASP}",
	journal = "Discrete Applied Mathematics",
	volume = "100",
	pages = "95--113",
        year = "2000",
        annote   =     "A set of {Fortran} subroutines for
                	computing approximate solutions of {MAX-SAT} problems
                	is described. The algorithm implemented was
                	proposed by Resende, Pitsoulis, and Pardalos (1997).
                	Two versions of the subroutines
                	are distributed. One version uses a neighborhood data
                	structure in order to speed up the local search phase, while
                	the second version, since it does not make use of this data
                	structure, is more memory efficient but less time efficient.
                	Computational results improve upon those in
                	Resende, Pitsoulis, and Pardalos (1997) using an RCL
                	parameter $\alpha$ randomly chosen each {GRASP} iteration
                	from the interval $[0,1]$.",
}

@Article{RibRes99a,
	author = "C.C. Ribeiro and M.G.C. Resende",
	title = "Algorithm 797: {Fortran} subroutines for
		 approximate solution of
		 graph planarization problems using {GRASP}",
	journal = "ACM Transactions on Mathematical Software",
	volume = "25",
	pages = "341--352",
	year = "1999",
        annote   =     "This paper describes a set of Fortran subroutines that
                	implements the {GRASP} for graph planarization
                	of Resende and Ribeiro (1997).",
}