Rafael Martí
Orcid: 0000-0001-7265-823X
According to our database1,
Rafael Martí
authored at least 136 papers
between 1996 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Appl. Soft Comput., 2025
2024
A Weighted Vertex Cover-Based Intensification Tabu Search for the Capacitated Dispersion Problem.
IEEE Trans. Emerg. Top. Comput. Intell., December, 2024
J. Heuristics, December, 2024
Expert Syst. Appl., 2024
Comput. Oper. Res., 2024
Proceedings of the Metaheuristics - 15th International Conference, 2024
2023
Optim. Lett., December, 2023
Expert Syst. Appl., November, 2023
A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics.
Ann. Oper. Res., 2023
2022
Expert Syst. Appl., 2022
Eur. J. Oper. Res., 2022
2021
Memetic Comput., 2021
Expert Syst. Appl., 2021
A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands.
Comput. Oper. Res., 2021
2020
Int. Trans. Oper. Res., 2020
Inf. Sci., 2020
Iterated greedy with variable neighborhood search for a multiobjective waste collection problem.
Expert Syst. Appl., 2020
2019
Heuristic Solutions for a Class of Stochastic Uncapacitated <i>p</i>-Hub Median Problems.
Transp. Sci., 2019
Eur. J. Oper. Res., 2019
2018
Prog. Artif. Intell., 2018
Multi-objective memetic optimization for the bi-objective obnoxious <i>p</i>-median problem.
Knowl. Based Syst., 2018
Models and solution methods for the uncapacitated r-allocation p-hub equitable center problem.
Int. Trans. Oper. Res., 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
J. Glob. Optim., 2017
Electron. Notes Discret. Math., 2017
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem.
Comput. Oper. Res., 2017
Comput. Oper. Res., 2017
Comput. Optim. Appl., 2017
Appl. Soft Comput., 2017
2016
J. Heuristics, 2016
Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem.
Eur. J. Oper. Res., 2016
2015
Metaheuristic procedures for the lexicographic bottleneck assembly line balancing problem.
J. Oper. Res. Soc., 2015
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.
Inf. Sci., 2015
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies.
Electron. Notes Discret. Math., 2015
Comput. Optim. Appl., 2015
2014
Soft Comput., 2014
J. Glob. Optim., 2014
Int. Trans. Oper. Res., 2014
Comput. Oper. Res., 2014
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem.
Comput. Oper. Res., 2014
Comput. Optim. Appl., 2014
2013
Designing effective improvement methods for scatter search: an experimental study on global optimization.
Soft Comput., 2013
Knowl. Based Syst., 2013
J. Oper. Res. Soc., 2013
Comput. Oper. Res., 2013
Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications.
Comput. Oper. Res., 2013
2012
GRASP and path relinking hybridizations for the point matching-based image registration problem.
J. Heuristics, 2012
J. Heuristics, 2012
Eur. J. Oper. Res., 2012
Comput. Oper. Res., 2012
A benchmark library and a comparison of heuristic methods for the linear ordering problem.
Comput. Optim. Appl., 2012
2011
Int. J. Swarm Intell. Res., 2011
Int. J. Appl. Metaheuristic Comput., 2011
Comput. Optim. Appl., 2011
Ann. Oper. Res., 2011
2010
Eur. J. Oper. Res., 2010
Comput. Oper. Res., 2010
Comput. Oper. Res., 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. Glob. Optim., 2009
Comput. Oper. Res., 2009
Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications, 2009
2008
INFORMS J. Comput., 2008
Eur. J. Oper. Res., 2008
Adaptive memory programing for the robust capacitated international sourcing problem.
Comput. Oper. Res., 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization.
INFORMS J. Comput., 2007
INFORMS J. Comput., 2007
INFORMS J. Comput., 2007
2006
Comput. Oper. Res., 2006
2005
Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions.
J. Glob. Optim., 2005
INFORMS J. Comput., 2005
Proceedings of the Hybrid Metaheuristics, Second International Workshop, 2005
2004
Eur. J. Oper. Res., 2004
Comput. Oper. Res., 2004
2003
Discret. Appl. Math., 2003
Proceedings of the Handbook of Metaheuristics, 2003
2002
J. Oper. Res. Soc., 2002
Comput. Oper. Res., 2002
2001
J. Glob. Optim., 2001
2000
1999
INFORMS J. Comput., 1999
J. Heuristics, 1999
Intensification and diversification with elite tabu search solutions for the linear ordering problem.
Comput. Oper. Res., 1999
1998
1997
Comput. Oper. Res., 1997
1996
J. Heuristics, 1996
Ann. Oper. Res., 1996