Rafael Martí

Rafael Martí

Auto-generated profile, based on publicly available information

Rafael Martí

University of Valencia

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2007 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
ZUZsolt Ugray
Zsolt Ugray
LLLeon Lasdon
Leon Lasdon
JPJohn Plummer
John Plummer
FGFred Glover
Fred Glover
JKJames Kelly
James Kelly
RMRafael Martí
Rafael Martí
The algorithm described here, called OptQuest/NLP or OQNLP, is a heuristic designed to find global optima for pure and mixed integer nonlinear problems with many constraints and variables, where all problem functions are differentiable with respect to the continuous variables. It uses OptQuest, a commercial implementation of scatter search developed by OptTek Systems, Inc., to provide starting points for any gradient-based local solver for nonlinear programming (NLP) problems. This solver seeks a local solution from a subset of these points, holding discrete variables fixed. The procedure is motivated by our desire to combine the superior accuracy and feasibility-seeking behavior of gradient-based local NLP solvers with the global optimization abilities of OptQuest. Computational results include 155 smooth NLP and mixed integer nonlinear program (MINLP) problems due to Floudas et al. (1999), most with both linear and nonlinear constraints, coded in the GAMS modeling language. Some are quite large for global optimization, with over 100 variables and 100 constraints. Global solutions to almost all problems are found in a small number of local solver calls, often one or two.

1 March 2006 in European Journal of Operational Research
Verified
Journal Article
Closed access
RMRafael Martí
Rafael Martí
MLManuel Laguna
Manuel Laguna
FGFred Glover
Fred Glover

1 February 1999 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
MLManuel Laguna
Manuel Laguna
RMRafael Marti
Rafael Marti
In this article, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straight line crossings in a 2-layer graph. The procedure is fast and is particularly appealing when dealing with low-density graphs. When a modest increase in computational time is allowed, the procedure may be coupled with a path relinking strategy to search for improved outcomes. Although the principles of path relinking have appeared in the tabu search literature, this search strategy has not been fully implemented and tested. We perform extensive computational experiments with more than 3,000 graph instances to first study the effect of changes in critical search parameters and then to compare the efficiency of alternative solution procedures. Our results indicate that graph density is a major influential factor on the performance of a solution procedure.

1 October 2005 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
MLManuel Laguna
Manuel Laguna
RMRafael Martí
Rafael Martí

1 April 2013 in European Journal of Operational Research
Verified
Journal Article
Closed access
RMRafael Martí
Rafael Martí
MRMauricio G.C. Resende
Mauricio G.C. Resende
CRCelso C. Ribeiro
Celso C. Ribeiro

1 March 2010 in Computers & Operations Research
Verified
Journal Article
Closed access
MRM.G.C. Resende
M.G.C. Resende
RMR. Martí
R. Martí
MCMICAEL GALLEGO CARRILLO
MICAEL GALLEGO CARRILLO
ADA. Duarte
A. Duarte