Rafael Martí

According to our database1, Rafael Martí authored at least 113 papers between 1996 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
A parallel variable neighborhood search approach for the obnoxious p-median problem.
ITOR, 2020

2019
Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems.
Transportation Science, 2019

Heuristics for the Constrained Incremental Graph Drawing Problem.
European Journal of Operational Research, 2019

2018
Diversity and Equity Models.
Proceedings of the Handbook of Heuristics., 2018

Linear Layout Problems.
Proceedings of the Handbook of Heuristics., 2018

Multi-start Methods.
Proceedings of the Handbook of Heuristics., 2018

Scatter Search.
Proceedings of the Handbook of Heuristics., 2018

Scatter search for the bi-criteria p-median p-dispersion problem.
Progress in AI, 2018

Multi-objective memetic optimization for the bi-objective obnoxious p-median problem.
Knowl.-Based Syst., 2018

Models and solution methods for the uncapacitated r-allocation p-hub equitable center problem.
ITOR, 2018

Heuristics for the min-max arc crossing problem in graphs.
Expert Syst. Appl., 2018

Heuristics for the Bi-Objective Diversity Problem.
Expert Syst. Appl., 2018

Tabu search for the dynamic Bipartite Drawing Problem.
Computers & OR, 2018

Principles and Strategies of Tabu Search.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Heuristic solution approaches for the maximum minsum dispersion problem.
J. Global Optimization, 2017

Randomized heuristics for the Capacitated Clustering Problem.
Inf. Sci., 2017

Variable neighborhood descent for the incremental graph drawing.
Electronic Notes in Discrete Mathematics, 2017

GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem.
Computers & OR, 2017

Heuristics for the capacitated modular hub location problem.
Computers & OR, 2017

Variable neighborhood scatter search for the incremental graph drawing problem.
Comp. Opt. and Appl., 2017

Improving the performance of embedded systems with variable neighborhood search.
Appl. Soft Comput., 2017

2016
Scatter search for the bandpass problem.
J. Global Optimization, 2016

Strategic oscillation for the capacitated hub location problem with modular links.
J. Heuristics, 2016

Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem.
European Journal of Operational Research, 2016

A genetic algorithm for the minimum generating set problem.
Appl. Soft Comput., 2016

2015
Scatter search for the profile minimization problem.
Networks, 2015

Tabu search for the Max-Mean Dispersion Problem.
Knowl.-Based Syst., 2015

Metaheuristic procedures for the lexicographic bottleneck assembly line balancing problem.
JORS, 2015

Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.
Inf. Sci., 2015

Multiobjective GRASP with Path Relinking.
European Journal of Operational Research, 2015

Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies.
Electronic Notes in Discrete Mathematics, 2015

Scatter search for an uncapacitated p-hub median problem.
Computers & OR, 2015

Tabu search and GRASP for the capacitated clustering problem.
Comp. Opt. and Appl., 2015

2014
GRASP with ejection chains for the dynamic memory allocation in embedded systems.
Soft Comput., 2014

GRASP with path relinking for the orienteering problem.
JORS, 2014

A black-box scatter search for optimization problems with integer variables.
J. Global Optimization, 2014

Improved heuristics for the regenerator location problem.
ITOR, 2014

GRASP for the uncapacitated r-allocation p-hub median problem.
Computers & OR, 2014

Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem.
Computers & OR, 2014

Strategic oscillation for the quadratic multiple knapsack problem.
Comp. Opt. and Appl., 2014

2013
Designing effective improvement methods for scatter search: an experimental study on global optimization.
Soft Comput., 2013

A hybrid metaheuristic for the cyclic antibandwidth problem.
Knowl.-Based Syst., 2013

Tabu search with strategic oscillation for the maximally diverse grouping problem.
JORS, 2013

Heuristics and metaheuristics for the maximum diversity problem.
J. Heuristics, 2013

Multi-start methods for combinatorial optimization.
European Journal of Operational Research, 2013

GRASP and path relinking for the equitable dispersion problem.
Computers & OR, 2013

Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications.
Computers & OR, 2013

Branch and bound for the cutwidth minimization problem.
Computers & OR, 2013

2012
GRASP and path relinking hybridizations for the point matching-based image registration problem.
J. Heuristics, 2012

Variable neighborhood search with ejection chains for the antibandwidth problem.
J. Heuristics, 2012

Metaheuristics for the linear ordering problem with cumulative costs.
European Journal of Operational Research, 2012

Variable neighborhood search for the Vertex Separation Problem.
Computers & OR, 2012

A benchmark library and a comparison of heuristic methods for the linear ordering problem.
Comp. Opt. and Appl., 2012

Scatter search for the cutwidth minimization problem.
Annals OR, 2012

2011
Path relinking for large-scale global optimization.
Soft Comput., 2011

GRASP with path relinking heuristics for the antibandwidth problem.
Networks, 2011

Scatter tabu search for multiobjective clustering problems.
JORS, 2011

Scatter Search and Path Relinking : A Tutorial on the Linear Arrangement Problem.
IJSIR, 2011

Pseudo-Cut Strategies for Global Optimization.
Int. J. of Applied Metaheuristic Computing, 2011

Tabu search for the linear ordering problem with cumulative costs.
Comp. Opt. and Appl., 2011

Hybrid scatter tabu search for unconstrained global optimization.
Annals OR, 2011

Adaptive memory programming for matrix bandwidth minimization.
Annals OR, 2011

2010
Heuristics for the bandwidth colouring problem.
IJMHeur, 2010

A branch and bound algorithm for the maximum diversity problem.
European Journal of Operational Research, 2010

GRASP and path relinking for the max-min diversity problem.
Computers & OR, 2010

Adaptive memory programming for constrained global optimization.
Computers & OR, 2010

Black box scatter search for general classes of binary optimization problems.
Computers & OR, 2010

An evolutionary method for complex-process optimization.
Computers & OR, 2010

GRASP & evolutionary path relinking for medical image registration based on point matching.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
Improved scatter search for the global optimization of computationally expensive dynamic models.
J. Global Optimization, 2009

Advanced Scatter Search for the Max-Cut Problem.
INFORMS Journal on Computing, 2009

Heuristics for the bi-objective path dissimilarity problem.
Computers & OR, 2009

Hybridizing the cross-entropy method: An application to the max-cut problem.
Computers & OR, 2009

Hybrid heuristics for the maximum diversity problem.
Comp. Opt. and Appl., 2009

An Adaptive Memory Procedure for Continuous Optimization.
Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications, 2009

2008
Scatter Search for the Point-Matching Problem in 3D Image Registration.
INFORMS Journal on Computing, 2008

A branch and bound algorithm for the matrix bandwidth minimization.
European Journal of Operational Research, 2008

Adaptive memory programing for the robust capacitated international sourcing problem.
Computers & OR, 2008

2007
Principles of Tabu Search.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Scatter search for chemical and bio-process optimization.
J. Global Optimization, 2007

Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization.
INFORMS Journal on Computing, 2007

SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization.
INFORMS Journal on Computing, 2007

GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem.
INFORMS Journal on Computing, 2007

Tabu search and GRASP for the maximum diversity problem.
European Journal of Operational Research, 2007

2006
Principles of scatter search.
European Journal of Operational Research, 2006

Scatter Search - Wellsprings and Challenges.
European Journal of Operational Research, 2006

Path relinking and GRG for artificial neural networks.
European Journal of Operational Research, 2006

Variable neighborhood search for the linear ordering problem.
Computers & OR, 2006

2005
Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions.
J. Global Optimization, 2005

Context-Independent Scatter and Tabu Search for Permutation Problems.
INFORMS Journal on Computing, 2005

Approximating Unknown Mappings: An Experimental Evaluation.
J. Heuristics, 2005

3D Inter-subject Medical Image Registration by Scatter Search.
Proceedings of the Hybrid Metaheuristics, Second International Workshop, 2005

2004
GRASP and path relinking for the matrix bandwidth minimization.
European Journal of Operational Research, 2004

Multilayer neural networks: an experimental evaluation of on-line training methods.
Computers & OR, 2004

2003
Heuristics and Meta-heuristics for 2-layer Straight Line Crossing Minimization.
Discrete Applied Mathematics, 2003

Métodos Multiarranque.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2003

Scatter Search: Diseño Básico y Estrategias avanzadas.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2003

Multi-Start Methods.
Proceedings of the Handbook of Metaheuristics, 2003

Scatter Search and Path Relinking: Advances and Applications.
Proceedings of the Handbook of Metaheuristics, 2003

2002
A GRASP heuristic for the mixed Chinese postman problem.
European Journal of Operational Research, 2002

The Rural Postman Problem on mixed graphs with turn penalties.
Computers & OR, 2002

2001
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem.
J. Global Optimization, 2001

Reducing the bandwidth of a sparse matrix with tabu search.
European Journal of Operational Research, 2001

Incremental bipartite drawing problem.
Computers & OR, 2001

A GRASP for Coloring Sparse Graphs.
Comp. Opt. and Appl., 2001

2000
Heuristics for the Mixed Rural Postman Problem.
Computers & OR, 2000

1999
GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization.
INFORMS Journal on Computing, 1999

GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps.
J. Heuristics, 1999

Intensification and diversification with elite tabu search solutions for the linear ordering problem.
Computers & OR, 1999

1998
A tabu search algorithm for the bipartite drawing problem.
European Journal of Operational Research, 1998

1997
Arc crossing minimization in hierarchical digraphs with tabu search.
Computers & OR, 1997

1996
A heuristic algorithm for project scheduling with splitting allowed.
J. Heuristics, 1996

A tabu thresholding algorithm for arc crossing minimization in bipartite graphs.
Annals OR, 1996


  Loading...