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.
Variable Neighborhood Search for the Vertex Separation Problem
Duarte, Mladenovic, Martí, Pantrigo and Sánchez-Oro,
Computers and Operations Research Accepted in April 2012
GRASP and PR for the Equitable Dispersion Problem
Rafael Martí and Fernando Sandoya,
Computers and Operations Research Accepted in February 2012
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
Tabu Search with SO for the Quadratic Mininum Spanning Tree
Lozano, Glover, García-Martinez, Rodríguez and Martí. University of Granada. April 2012
A Survey of Multi-Start Methods for Combinatorial Optimization
R. Martí, M. Resende, and C. Ribeiro. AT&T Research Labs. March 2012
Multi-objective GRASP with path-relinking
R. Martí, V. Campos, M. Resende and A. Duarte. AT&T Research Labs. November 2011
Branch and Bound for the Cutwidth Minimization problem
R. Martí, J.J. Pantrigo, A. Duarte and E. Pardo.
Technical report. University Rey Juan Carlos. May 2011