default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafael Martí
Person information
Other persons with a similar name
- Rafael Martins D'Addio
- Rafael Falcon
![[0000-0002-5906-3626]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-5906-3626")
(aka: Rafael Falcon Martinez, Rafael Falcón) — University of Ottawa, Canada - Rafael M. Gasca (aka: Rafael Martinez Gasca)
- Rafael J. Martínez-Durá
- Rafael Martínez-Guerra
- Rafael Martínez-Olalla (aka: Rafael Martínez 0001) — Technical University of Madrid, Montegancedo Campus, Biomedical Technology Center, Spain
- Rafael Martínez-Peláez
- Rafael Martínez-Tomás
- Rafael Martinelli
- Rafael Messias Martins — Linnaeus University, Department of Computer Science and Media Technology, Sweden (and 1 more)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j124]Jesús Sánchez-Oro, Anna Martínez-Gavara, Ana Dolores López-Sánchez, Rafael Martí, Abraham Duarte:
GRASP with Evolutionary Path Relinking for the conditional p-Dispersion problem. Appl. Soft Comput. 168: 112494 (2025)- [j123]Rafael Martí, Marc Sevaux, Kenneth Sörensen:
Fifty years of metaheuristics. Eur. J. Oper. Res. 321(2): 345-362 (2025) - 2024
- [j122]Bo Peng, Lunwen Wu, Rafael Martí, Jiangshui Ma:
A fast path relinking algorithm for the min-max edge crossing problem. Comput. Oper. Res. 166: 106603 (2024) - [j121]Sergio Cavero, Eduardo G. Pardo, Fred W. Glover, Rafael Martí:
Strategic oscillation tabu search for improved hierarchical graph drawing. Expert Syst. Appl. 243: 122668 (2024) - [j120]Rafael Martí, Francisco Parreño, Jorge Mortes:
Mathematical models and solving methods for diversity and equity optimization. J. Heuristics 30(5): 291-323 (2024) - [j119]Yang Wang, Zhipeng Lü, Junwen Ding, Zhouxing Su, Rafael Martí:
A Weighted Vertex Cover-Based Intensification Tabu Search for the Capacitated Dispersion Problem. IEEE Trans. Emerg. Top. Comput. Intell. 8(6): 4225-4236 (2024) - [c4]Miguel Reula, Consuelo Parreño-Torres, Anna Martínez-Gavara, Rafael Martí:
VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem. MIC (1) 2024: 103-109 - 2023
- [j118]Angel A. Juan, Peter B. Keenan, Rafael Martí, Seán McGarraghy, Javier Panadero, Paula Carroll, Diego Oliva:
A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics. Ann. Oper. Res. 320(2): 831-861 (2023) - [j117]Miguel Reula, Rafael Martí:
Heuristics for the Profitable Close-Enough Arc Routing Problem. Expert Syst. Appl. 230: 120513 (2023) - [j116]Yogita Singh Kardam, Kamal Srivastava, Rafael Martí:
General variable neighborhood search for the minimum stretch spanning tree problem. Optim. Lett. 17(9): 2005-2031 (2023) - 2022
- [j115]Yogita Singh Kardam, Kamal Srivastava, Pallavi Jain, Rafael Martí:
Scatter search for the minimum leaf spanning tree problem. Comput. Oper. Res. 145: 105858 (2022) - [j114]Rafael Martí, Anna Martínez-Gavara, Sergio Pérez-Peló, Jesús Sánchez-Oro:
A review on discrete diversity and dispersion maximization from an OR perspective. Eur. J. Oper. Res. 299(3): 795-813 (2022) - [j113]Isaac Lozano-Osorio, Anna Martínez-Gavara, Rafael Martí, Abraham Duarte:
Max-min dispersion with capacity and cost for a practical location problem. Expert Syst. Appl. 200: 116899 (2022) - 2021
- [j112]Peter B. Keenan, Javier Panadero, Angel A. Juan, Rafael Martí, Seán McGarraghy:
A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands. Comput. Oper. Res. 133: 105377 (2021) - [j111]Francisco Parreño, Ramón Alvarez-Valdés, Rafael Martí:
Measuring diversity. A review and an empirical analysis. Eur. J. Oper. Res. 289(2): 515-532 (2021) - [j110]Anna Martínez-Gavara, Teresa Corberán, Rafael Martí:
GRASP and tabu search for the generalized dispersion problem. Expert Syst. Appl. 173: 114703 (2021) - [j109]Juanjo Peiró, Iris Jiménez, José Laguardia, Rafael Martí:
Heuristics for the capacitated dispersion problem. Int. Trans. Oper. Res. 28(1): 119-141 (2021) - [j108]Rafael Martí, Anna Martínez-Gavara, Jesús Sánchez-Oro:
The capacitated dispersion problem: an optimization model and a memetic algorithm. Memetic Comput. 13(1): 131-146 (2021) - 2020
- [j107]Tommaso Pastore, Anna Martínez-Gavara, Antonio Napoletano, Paola Festa, Rafael Martí:
Tabu search for min-max edge crossing in graphs. Comput. Oper. Res. 114 (2020) - [j106]Laura Delgado-Antequera, Rafael Caballero, Jesús Sánchez-Oro, J. Manuel Colmenar, Rafael Martí:
Iterated greedy with variable neighborhood search for a multiobjective waste collection problem. Expert Syst. Appl. 145: 113101 (2020) - [j105]Bo Peng, Donghao Liu, Zhipeng Lü, Rafael Martí, Junwen Ding:
Adaptive memory programming for the dynamic bipartite drawing problem. Inf. Sci. 517: 183-197 (2020) - [j104]Alberto Herran, José Manuel Colmenar, Rafael Martí, Abraham Duarte:
A parallel variable neighborhood search approach for the obnoxious p-median problem. Int. Trans. Oper. Res. 27(1): 336-360 (2020)
2010 – 2019
- 2019
- [j103]Antonio Napoletano, Anna Martínez-Gavara, Paola Festa, Tommaso Pastore, Rafael Martí:
Heuristics for the Constrained Incremental Graph Drawing Problem. Eur. J. Oper. Res. 274(2): 710-729 (2019) - [j102]Juanjo Peiró, Ángel Corberán, Rafael Martí, Francisco Saldanha-da-Gama:
Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems. Transp. Sci. 53(4): 1126-1149 (2019) - 2018
- [j101]Rafael Martí, Anna Martínez-Gavara, Jesús Sánchez-Oro, Abraham Duarte:
Tabu search for the dynamic Bipartite Drawing Problem. Comput. Oper. Res. 91: 1-12 (2018) - [j100]José Manuel Colmenar, Rafael Martí, Abraham Duarte:
Heuristics for the Bi-Objective Diversity Problem. Expert Syst. Appl. 108: 193-205 (2018) - [j99]Rafael Martí, Vicente Campos, Arild Hoff, Juanjo Peiró:
Heuristics for the min-max arc crossing problem in graphs. Expert Syst. Appl. 109: 100-113 (2018) - [j98]Juanjo Peiró, Ángel Corberán, Manuel Laguna, Rafael Martí:
Models and solution methods for the uncapacitated r-allocation p-hub equitable center problem. Int. Trans. Oper. Res. 25(4): 1241-1267 (2018) - [j97]José Manuel Colmenar, Rafael Martí, Abraham Duarte:
Multi-objective memetic optimization for the bi-objective obnoxious p-median problem. Knowl. Based Syst. 144: 88-101 (2018) - [j96]J. Manuel Colmenar, Arild Hoff, Rafael Martí, Abraham Duarte:
Scatter search for the bi-criteria p-median p-dispersion problem. Prog. Artif. Intell. 7(1): 31-40 (2018) - [p3]Fred W. Glover, Manuel Laguna, Rafael Martí:
Principles and Strategies of Tabu Search. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 361-377 - [e1]Rafael Martí, Panos M. Pardalos, Mauricio G. C. Resende:
Handbook of Heuristics. Springer 2018, ISBN 978-3-319-07123-7 [contents] - [r5]Rafael Martí, José Antonio Lozano, Alexander Mendiburu, Leticia Hernando:
Multi-start Methods. Handbook of Heuristics 2018: 155-175 - [r4]Rafael Martí, Ángel Corberán, Juanjo Peiró:
Scatter Search. Handbook of Heuristics 2018: 717-740 - [r3]Fernando Sandoya, Anna Martínez-Gavara, Ricardo Aceves, Abraham Duarte, Rafael Martí:
Diversity and Equity Models. Handbook of Heuristics 2018: 979-998 - [r2]Eduardo G. Pardo, Rafael Martí, Abraham Duarte:
Linear Layout Problems. Handbook of Heuristics 2018: 1025-1049 - 2017
- [j95]Jesús Sánchez-Oro, Marc Sevaux, André Rossi, Rafael Martí, Abraham Duarte:
Improving the performance of embedded systems with variable neighborhood search. Appl. Soft Comput. 53: 217-226 (2017) - [j94]Jesús Sánchez-Oro, Anna Martínez-Gavara, Manuel Laguna, Rafael Martí, Abraham Duarte:
Variable neighborhood scatter search for the incremental graph drawing problem. Comput. Optim. Appl. 68(3): 775-797 (2017) - [j93]Francisco J. Rodríguez, Fred W. Glover, Carlos García-Martínez, Rafael Martí, Manuel Lozano:
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem. Comput. Oper. Res. 78: 243-254 (2017) - [j92]Arild Hoff, Juanjo Peiró, Ángel Corberán, Rafael Martí:
Heuristics for the capacitated modular hub location problem. Comput. Oper. Res. 86: 94-109 (2017) - [j91]Jesús Sánchez-Oro, Anna Martínez-Gavara, Manuel Laguna, Abraham Duarte, Rafael Martí:
Variable neighborhood descent for the incremental graph drawing. Electron. Notes Discret. Math. 58: 183-190 (2017) - [j90]Anna Martínez-Gavara, Dario Landa-Silva, Vicente Campos, Rafael Martí:
Randomized heuristics for the Capacitated Clustering Problem. Inf. Sci. 417: 154-168 (2017) - [j89]Anna Martínez-Gavara, Vicente Campos, Manuel Laguna, Rafael Martí:
Heuristic solution approaches for the maximum minsum dispersion problem. J. Glob. Optim. 67(3): 671-686 (2017) - 2016
- [j88]Manuel Lozano, Manuel Laguna, Rafael Martí, Francisco J. Rodríguez, Carlos García-Martínez:
A genetic algorithm for the minimum generating set problem. Appl. Soft Comput. 48: 254-264 (2016) - [j87]J. Manuel Colmenar, Peter Greistorfer, Rafael Martí, Abraham Duarte:
Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem. Eur. J. Oper. Res. 252(2): 432-442 (2016) - [j86]Ángel Corberán, Juanjo Peiró, Vicente Campos, Fred W. Glover, Rafael Martí:
Strategic oscillation for the capacitated hub location problem with modular links. J. Heuristics 22(2): 221-244 (2016) - [j85]Jesús Sánchez-Oro, Manuel Laguna, Rafael Martí, Abraham Duarte:
Scatter search for the bandpass problem. J. Glob. Optim. 66(4): 769-790 (2016) - 2015
- [j84]Anna Martínez-Gavara, Vicente Campos, Micael Gallego, Manuel Laguna, Rafael Martí:
Tabu search and GRASP for the capacitated clustering problem. Comput. Optim. Appl. 62(2): 589-607 (2015) - [j83]Rafael Martí, Angel Corberán, Juanjo Peiró:
Scatter search for an uncapacitated p-hub median problem. Comput. Oper. Res. 58: 53-66 (2015) - [j82]Jesús Sánchez-Oro, Marc Sevaux, André Rossi, Rafael Martí, Abraham Duarte:
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies. Electron. Notes Discret. Math. 47: 85-92 (2015) - [j81]Rafael Martí, Vicente Campos, Mauricio G. C. Resende, Abraham Duarte:
Multiobjective GRASP with Path Relinking. Eur. J. Oper. Res. 240(1): 54-71 (2015) - [j80]Abraham Duarte, Jesús Sánchez-Oro, Mauricio G. C. Resende, Fred W. Glover, Rafael Martí:
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization. Inf. Sci. 296: 46-60 (2015) - [j79]Rafael Pastor, Alberto García-Villoria, Manuel Laguna, Rafael Martí:
Metaheuristic procedures for the lexicographic bottleneck assembly line balancing problem. J. Oper. Res. Soc. 66(11): 1815-1825 (2015) - [j78]Rubén Carrasco, AnThanh Pham, Micael Gallego, Francisco Gortázar, Rafael Martí, Abraham Duarte:
Tabu search for the Max-Mean Dispersion Problem. Knowl. Based Syst. 85: 256-264 (2015) - [j77]Jesús Sánchez-Oro, Manuel Laguna, Abraham Duarte, Rafael Martí:
Scatter search for the profile minimization problem. Networks 65(1): 10-21 (2015) - 2014
- [j76]Carlos García-Martínez, Fred W. Glover, Francisco J. Rodríguez, Manuel Lozano, Rafael Martí:
Strategic oscillation for the quadratic multiple knapsack problem. Comput. Optim. Appl. 58(1): 161-185 (2014) - [j75]Juanjo Peiró, Angel Corberán, Rafael Martí:
GRASP for the uncapacitated r-allocation p-hub median problem. Comput. Oper. Res. 43: 50-60 (2014) - [j74]Abraham Duarte, Manuel Laguna, Rafael Martí, Jesús Sánchez-Oro:
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem. Comput. Oper. Res. 51: 123-129 (2014) - [j73]Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva:
Improved heuristics for the regenerator location problem. Int. Trans. Oper. Res. 21(4): 541-558 (2014) - [j72]Manuel Laguna, Francisco Gortázar, Micael Gallego, Abraham Duarte, Rafael Martí:
A black-box scatter search for optimization problems with integer variables. J. Glob. Optim. 58(3): 497-516 (2014) - [j71]Vicente Campos, Rafael Martí, Jesús Sánchez-Oro, Abraham Duarte:
GRASP with path relinking for the orienteering problem. J. Oper. Res. Soc. 65(12): 1800-1813 (2014) - [j70]Marc Sevaux, André Rossi, María Soto, Abraham Duarte, Rafael Martí:
GRASP with ejection chains for the dynamic memory allocation in embedded systems. Soft Comput. 18(8): 1515-1527 (2014) - 2013
- [j69]Rafael Martí, Juan José Pantrigo, Abraham Duarte, Eduardo G. Pardo:
Branch and bound for the cutwidth minimization problem. Comput. Oper. Res. 40(1): 137-149 (2013) - [j68]Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro:
Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications. Comput. Oper. Res. 40(12): 3080 (2013) - [j67]Rafael Martí, Fernando Sandoya:
GRASP and path relinking for the equitable dispersion problem. Comput. Oper. Res. 40(12): 3091-3099 (2013) - [j66]Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro:
Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. 226(1): 1-8 (2013) - [j65]Rafael Martí, Micael Gallego, Abraham Duarte, Eduardo G. Pardo:
Heuristics and metaheuristics for the maximum diversity problem. J. Heuristics 19(4): 591-615 (2013) - [j64]Micael Gallego, Manuel Laguna, Rafael Martí, Abraham Duarte:
Tabu search with strategic oscillation for the maximally diverse grouping problem. J. Oper. Res. Soc. 64(5): 724-734 (2013) - [j63]Manuel Lozano, Abraham Duarte, Francisco Gortázar, Rafael Martí:
A hybrid metaheuristic for the cyclic antibandwidth problem. Knowl. Based Syst. 54: 103-113 (2013) - [j62]Lars Magnus Hvattum, Abraham Duarte, Fred W. Glover, Rafael Martí:
Designing effective improvement methods for scatter search: an experimental study on global optimization. Soft Comput. 17(1): 49-62 (2013) - 2012
- [j61]Juan José Pantrigo, Rafael Martí, Abraham Duarte, Eduardo G. Pardo:
Scatter search for the cutwidth minimization problem. Ann. Oper. Res. 199(1): 285-304 (2012) - [j60]Rafael Martí, Gerhard Reinelt, Abraham Duarte:
A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput. Optim. Appl. 51(3): 1297-1317 (2012) - [j59]Abraham Duarte, Laureano F. Escudero, Rafael Martí, Nenad Mladenovic, Juan José Pantrigo, Jesús Sánchez-Oro:
Variable neighborhood search for the Vertex Separation Problem. Comput. Oper. Res. 39(12): 3247-3255 (2012) - [j58]Abraham Duarte, Rafael Martí, Ada M. Alvarez, Francisco Ángel-Bello:
Metaheuristics for the linear ordering problem with cumulative costs. Eur. J. Oper. Res. 216(2): 270-277 (2012) - [j57]José Santamaría, Oscar Cordón, Sergio Damas, Rafael Martí, Ricardo J. Palma:
GRASP and path relinking hybridizations for the point matching-based image registration problem. J. Heuristics 18(1): 169-192 (2012) - [j56]Manuel Lozano, Abraham Duarte, Francisco Gortázar, Rafael Martí:
Variable neighborhood search with ejection chains for the antibandwidth problem. J. Heuristics 18(6): 919-938 (2012) - 2011
- [j55]Vicente Campos, Estefanía Piñana, Rafael Martí:
Adaptive memory programming for matrix bandwidth minimization. Ann. Oper. Res. 183(1): 7-23 (2011) - [j54]Abraham Duarte, Rafael Martí, Fred W. Glover, Francisco Gortázar:
Hybrid scatter tabu search for unconstrained global optimization. Ann. Oper. Res. 183(1): 95-123 (2011) - [j53]Abraham Duarte, Manuel Laguna, Rafael Martí:
Tabu search for the linear ordering problem with cumulative costs. Comput. Optim. Appl. 48(3): 697-715 (2011) - [j52]Fred W. Glover, Leon S. Lasdon, John C. Plummer, Abraham Duarte, Rafael Martí, Manuel Laguna, César Rego:
Pseudo-Cut Strategies for Global Optimization. Int. J. Appl. Metaheuristic Comput. 2(4): 1-12 (2011) - [j51]Rafael Martí, Juan José Pantrigo, Abraham Duarte, Vicente Campos, Fred W. Glover:
Scatter Search and Path Relinking : A Tutorial on the Linear Arrangement Problem. Int. J. Swarm Intell. Res. 2(2): 1-21 (2011) - [j50]Rafael Caballero, Manuel Laguna, Rafael Martí, Julián Molina:
Scatter tabu search for multiobjective clustering problems. J. Oper. Res. Soc. 62(11): 2034-2046 (2011) - [j49]Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva:
GRASP with path relinking heuristics for the antibandwidth problem. Networks 58(3): 171-189 (2011) - [j48]Abraham Duarte, Rafael Martí, Francisco Gortázar:
Path relinking for large-scale global optimization. Soft Comput. 15(11): 2257-2273 (2011) - 2010
- [j47]Jose A. Egea, Rafael Martí, Julio R. Banga:
An evolutionary method for complex-process optimization. Comput. Oper. Res. 37(2): 315-324 (2010) - [j46]Mauricio G. C. Resende, Rafael Martí, Micael Gallego, Abraham Duarte:
GRASP and path relinking for the max-min diversity problem. Comput. Oper. Res. 37(3): 498-508 (2010) - [j45]Leon S. Lasdon, Abraham Duarte, Fred W. Glover, Manuel Laguna, Rafael Martí:
Adaptive memory programming for constrained global optimization. Comput. Oper. Res. 37(8): 1500-1509 (2010) - [j44]Francisco Gortázar, Abraham Duarte, Manuel Laguna, Rafael Martí:
Black box scatter search for general classes of binary optimization problems. Comput. Oper. Res. 37(11): 1977-1986 (2010) - [j43]Rafael Martí, Micael Gallego, Abraham Duarte:
A branch and bound algorithm for the maximum diversity problem. Eur. J. Oper. Res. 200(1): 36-44 (2010) - [j42]Rafael Martí, Francisco Gortázar, Abraham Duarte:
Heuristics for the bandwidth colouring problem. Int. J. Metaheuristics 1(1): 11-29 (2010) - [c3]José Santamaría, Oscar Cordón, Sergio Damas, Rafael Martí, Ricardo J. Palma:
GRASP & evolutionary path relinking for medical image registration based on point matching. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [j41]Micael Gallego, Abraham Duarte, Manuel Laguna, Rafael Martí:
Hybrid heuristics for the maximum diversity problem. Comput. Optim. Appl. 44(3): 411-426 (2009) - [j40]Manuel Laguna, Abraham Duarte, Rafael Martí:
Hybridizing the cross-entropy method: An application to the max-cut problem. Comput. Oper. Res. 36(2): 487-498 (2009) - [j39]Rafael Martí, José Luis González Velarde, Abraham Duarte:
Heuristics for the bi-objective path dissimilarity problem. Comput. Oper. Res. 36(11): 2905-2912 (2009) - [j38]Rafael Martí, Abraham Duarte, Manuel Laguna:
Advanced Scatter Search for the Max-Cut Problem. INFORMS J. Comput. 21(1): 26-38 (2009) - [j37]Jose A. Egea, Emmanuel Vázquez, Julio R. Banga, Rafael Martí:
Improved scatter search for the global optimization of computationally expensive dynamic models. J. Glob. Optim. 43(2-3): 175-190 (2009) - [c2]Abraham Duarte, Rafael Martí, Fred W. Glover:
An Adaptive Memory Procedure for Continuous Optimization. ISDA 2009: 1085-1089 - 2008
- [j36]José Luis González Velarde, Rafael Martí:
Adaptive memory programing for the robust capacitated international sourcing problem. Comput. Oper. Res. 35(3): 797-806 (2008) - [j35]Rafael Martí, Vicente Campos, Estefanía Piñana:
A branch and bound algorithm for the matrix bandwidth minimization. Eur. J. Oper. Res. 186(2): 513-528 (2008) - [j34]Oscar Cordón, Sergio Damas, José Santamaría, Rafael Martí:
Scatter Search for the Point-Matching Problem in 3D Image Registration. INFORMS J. Comput. 20(1): 55-68 (2008) - 2007
- [j33]Abraham Duarte, Rafael Martí:
Tabu search and GRASP for the maximum diversity problem. Eur. J. Oper. Res. 178(1): 71-84 (2007) - [j32]Julián Molina Luque, Manuel Laguna, Rafael Martí, Rafael Caballero:
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization. INFORMS J. Comput. 19(1): 91-100 (2007) - [j31]Ramón Alvarez-Valdés, Rafael Martí, José Manuel Tamarit, Antonio Parajón:
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem. INFORMS J. Comput. 19(2): 261-272 (2007) - [j30]Zsolt Ugray, Leon S. Lasdon, John C. Plummer, Fred W. Glover, James P. Kelly, Rafael Martí:
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization. INFORMS J. Comput. 19(3): 328-340 (2007) - [j29]Jose A. Egea, Maria Rodriguez-Fernandez, Julio R. Banga, Rafael Martí:
Scatter search for chemical and bio-process optimization. J. Glob. Optim. 37(3): 481-503 (2007) - [r1]Rafael Martí, Manuel Laguna, Fred W. Glover:
Principles of Tabu Search. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j28]Carlos G. García-González, Dionisio Pérez-Brito, Vicente Campos, Rafael Martí:
Variable neighborhood search for the linear ordering problem. Comput. Oper. Res. 33(12): 3549-3565 (2006) - [j27]Rafael Martí:
Scatter Search - Wellsprings and Challenges. Eur. J. Oper. Res. 169(2): 351-358 (2006) - [j26]Rafael Martí, Manuel Laguna, Fred W. Glover:
Principles of scatter search. Eur. J. Oper. Res. 169(2): 359-372 (2006) - [j25]Abdellah El-Fallahi, Rafael Martí, Leon S. Lasdon:
Path relinking and GRG for artificial neural networks. Eur. J. Oper. Res. 169(2): 508-519 (2006) - [j24]Joaquín Pacheco, Rafael Martí:
Tabu search for a multi-objective routing problem. J. Oper. Res. Soc. 57(1): 29-37 (2006) - 2005
- [j23]Rafael Martí, Francisco Montes, Abdellah El-Fallahi:
Approximating Unknown Mappings: An Experimental Evaluation. J. Heuristics 11(3): 219-232 (2005) - [j22]Vicente Campos, Manuel Laguna, Rafael Martí:
Context-Independent Scatter and Tabu Search for Permutation Problems. INFORMS J. Comput. 17(1): 111-122 (2005) - [j21]Manuel Laguna, Rafael Martí:
Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions. J. Glob. Optim. 33(2): 235-255 (2005) - [c1]Oscar Cordón, Sergio Damas, José Santamaría, Rafael Martí:
3D Inter-subject Medical Image Registration by Scatter Search. Hybrid Metaheuristics 2005: 90-103 - 2004
- [j20]Rafael Martí, Abdellah El-Fallahi:
Multilayer neural networks: an experimental evaluation of on-line training methods. Comput. Oper. Res. 31(9): 1491-1513 (2004) - [j19]Estefanía Piñana, Isaac Plana, Vicente Campos, Rafael Martí:
GRASP and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. 153(1): 200-210 (2004) - 2003
- [j18]Rafael Martí, J. Marcos Moreno-Vega:
Métodos Multiarranque. Inteligencia Artif. 7(19): 49-60 (2003) - [j17]Rafael Martí, Manuel Laguna:
Scatter Search: Diseño Básico y Estrategias avanzadas. Inteligencia Artif. 7(19): 123-130 (2003) - [j16]Rafael Martí, Manuel Laguna:
Heuristics and Meta-heuristics for 2-layer Straight Line Crossing Minimization. Discret. Appl. Math. 127(3): 665-678 (2003) - [p2]Fred W. Glover, Manuel Laguna, Rafael Martí:
Scatter Search and Path Relinking: Advances and Applications. Handbook of Metaheuristics 2003: 1-35 - [p1]Rafael Martí:
Multi-Start Methods. Handbook of Metaheuristics 2003: 355-368 - 2002
- [j15]Angel Corberán, Rafael Martí, Eulalia Martínez, David Soler:
The Rural Postman Problem on mixed graphs with turn penalties. Comput. Oper. Res. 29(7): 887-903 (2002) - [j14]Angel Corberán, Rafael Martí, José M. Sanchis:
A GRASP heuristic for the mixed Chinese postman problem. Eur. J. Oper. Res. 142(1): 70-80 (2002) - [j13]Ángel Corberán, Elena Fernández, Manuel Laguna, Rafael Martí:
Heuristic solutions to the problem of routing school buses with multiple objectives. J. Oper. Res. Soc. 53(4): 427-435 (2002) - 2001
- [j12]Manuel Laguna, Rafael Martí:
A GRASP for Coloring Sparse Graphs. Comput. Optim. Appl. 19(2): 165-178 (2001) - [j11]Rafael Martí, Vicente Estruch:
Incremental bipartite drawing problem. Comput. Oper. Res. 28(13): 1287-1298 (2001) - [j10]Rafael Martí, Manuel Laguna, Fred W. Glover, Vicente Campos:
Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135(2): 450-459 (2001) - [j9]Vicente Campos, Fred W. Glover, Manuel Laguna, Rafael Martí:
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem. J. Glob. Optim. 21(4): 397-414 (2001) - 2000
- [j8]Angel Corberán, Rafael Martí, Antonio Romero:
Heuristics for the Mixed Rural Postman Problem. Comput. Oper. Res. 27(2): 183-203 (2000)
1990 – 1999
- 1999
- [j7]Manuel Laguna, Rafael Martí, Vicente Campos:
Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26(12): 1217-1230 (1999) - [j6]Elena Fernández, Rafael Martí:
GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps. J. Heuristics 5(2): 181-197 (1999) - [j5]Manuel Laguna, Rafael Martí:
GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization. INFORMS J. Comput. 11(1): 44-52 (1999) - 1998
- [j4]Rafael Martí:
A tabu search algorithm for the bipartite drawing problem. Eur. J. Oper. Res. 106(2-3): 558-569 (1998) - 1997
- [j3]Manuel Laguna, Rafael Martí, Vicente Valls:
Arc crossing minimization in hierarchical digraphs with tabu search. Comput. Oper. Res. 24(12): 1175-1186 (1997) - 1996
- [j2]Vicente Valls, Rafael Martí, M. Pilar Lino Sorlí:
A tabu thresholding algorithm for arc crossing minimization in bipartite graphs. Ann. Oper. Res. 63(2): 233-251 (1996) - [j1]Vicente Valls, Rafael Martí, M. Pilar Lino Sorlí:
A heuristic algorithm for project scheduling with splitting allowed. J. Heuristics 2(1): 87-104 (1996)
Coauthor Index
[j124] [j113] [j104] [j101] [j100] [j97] [j96] [r3] [r2] [j95] [j94] [j91] [j87] [j85] [j82] [j81] [j80] [j78] [j77] [j74] [j73] [j72] [j71] [j70] [j69] [j65] [j64] [j63] [j62] [j61] [j60] [j59] [j58] [j56] [j54] [j53] [j52] [j51] [j49] [j48] [j46] [j45] [j44] [j43] [j42] [j41] [j40] [j39] [j38] [c2] [j33]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
