OPTSICOM
Rafael Martí coordinates the OPTSICOM research project. The acronym comes from
Optimization of Complex Systems. In this project we develop algorithms, based on metaheuristic methods,
which integrated in a software, solve hard optimization problems. It has
been funded by the Ministerio de Ciencia e Innovación under codes TIN2006-02696 (2007-2009) and
TIN2009-07516 (2010-2012). In the OPTSICOM website
codes, instances and best known solutions for the problems in which we are working are available.
Pseudo-Cut Strategies for Global Optimization
F. Glover, L. Lasdon, J. Plummer, A. Duarte, R. Martí and M. Laguna
International Journal of Applied Metaheuristic Computing. Accepted in December 2011
Tabu search with Strategic Oscillation for the maximally diverse grouping problem
Micael Gallego, Manuel Laguna, Rafael Martí and Abraham Duarte,
Journal of the Operational Research Society. Accepted in November 2011
Metaheuristics for the Linear Ordering Problem with Cumulative Costs
Abraham Duarte, Rafael Martí, Ada Álvarez and Francisco Ángel-Bello
European Journal of Operational Research Accepted in August 2011
Heuristics and Metaheuristics for the Maximum Diversity Problem
Rafael Martí, Micael Gallego and Abraham Duarte,
Journal of Heuristics Accepted in June 2011
Scatter search and Path Relinking. A tutorial on the Linear Arrangement
R. Martí, J. Pantrigo, A. Duarte, V. Campos and F. Glover,
International Journal of Swarm Intelligence Research Accepted in May 2011
Scatter Search for the cutwidth Minimization Problem
J.J. Pantrigo, R. Martí, A. Duarte and E.G. Pardo,
Annals of Operations Research Accepted in May 2011
GRASP and PR hybridizations for the point matching based Image Registration problem
J. Santamaría, O. Cordón, S. Damas, R. Martí and J. Palma,
Journal of Heuristics, Accepted in March 2011