Eduardo Rodriguez-Tello

Prof. Eduardo Rodriguez-Tello

Cinvestav Unidad Tamaulipas
orcid

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2012 in Information Sciences
Verified
Journal Article
Closed access
Jose Torres-JimenezJose Torres-Jimenez
Jose Torres-Jimenez
Eduardo Rodriguez-TelloEduardo Rodriguez-Tello
Eduardo Rodriguez-Tello

1 October 2008 in Computers & Operations Research
Verified
Journal Article
Closed access
Eduardo Rodriguez-TelloEduardo Rodriguez-Tello
Eduardo Rodriguez-Tello
JHJin-Kao Hao
Jin-Kao Hao
Jose Torres-JimenezJose Torres-Jimenez
Jose Torres-Jimenez

1 March 2008 in European Journal of Operational Research
Verified
Journal Article
Closed access
Eduardo Rodriguez-TelloEduardo Rodriguez-Tello
Eduardo Rodriguez-Tello
JHJin-Kao Hao
Jin-Kao Hao
Jose Torres-JimenezJose Torres-Jimenez
Jose Torres-Jimenez


1 May 2015 in Computers & Operations Research
Verified
Journal Article
Closed access
Eduardo Rodriguez-TelloEduardo Rodriguez-Tello
Eduardo Rodriguez-Tello
HRHillel Romero-Monsivais
Hillel Romero-Monsivais
GRGabriel Ramirez-Torres
Gabriel Ramirez-Torres
FLFrédéric Lardeux
Frédéric Lardeux

1 July 2010
Verified
Conference Paper
Closed access
Jose Torres-JimenezJose Torres-Jimenez
Jose Torres-Jimenez
Eduardo Rodriguez-TelloEduardo Rodriguez-Tello
Eduardo Rodriguez-Tello
This paper presents new upper bounds for binary covering arrays of variable strength constructed by using a new Simulated Annealing (SA) algorithm. This algorithm incorporates several distinguished features including an efficient heuristic to generate good quality initial solutions, a compound neighborhood function which combines two carefully designed neighborhoods and a fine-tuned cooling schedule. Its performance is investigated through extensive experimentation over well known benchmarks and compared with other state-of-the-art algorithms, showing that the proposed SA algorithm is able to outperform them.