Mart Rafael

Rafael Mart

Information about the author Rafael Mart will soon be added to the site.
Found 39 papers in total
Metaheuristic procedures for the lexicographic bottleneck assembly line balancing problem
Metaheuristic procedures for the lexicographic bottleneck assembly line balancing problem
2015
The goal of this work is to develop an improved procedure for the solution of the...
Scatter search for the profile minimization problem
Scatter search for the profile minimization problem
2015
We study the problem of minimizing the profile of a graph and develop a solution...
GRASP with path relinking for the orienteering problem
GRASP with path relinking for the orienteering problem
2014
In this paper, we address an optimization problem resulting from the combination of...
Multi‐start methods for combinatorial optimization
Multi‐start methods for combinatorial optimization
2013
Multi‐start methods strategically sample the solution space of an optimization...
Variable neighborhood search with ejection chains for the antibandwidth problem
Variable neighborhood search with ejection chains for the antibandwidth problem
2012
In this paper, we address the optimization problem arising in some practical...
Black box scatter search for general classes of binary optimization problems
Black box scatter search for general classes of binary optimization problems
2010
The purpose of this paper is to apply the scatter search methodology to general...
Branch and bound for the cutwidth minimization problem
Branch and bound for the cutwidth minimization problem
2013
The cutwidth minimization problem consists of finding a linear arrangement of the...
Scatter search for the cutwidth minimization problem
Scatter search for the cutwidth minimization problem
2012
The cutwidth minimization problem consists of finding a linear layout of a graph so...
GRASP and path relinking hybridizations for the point matching‐based image registration problem
GRASP and path relinking hybridizations for the point matching‐based image registration problem
2012
In the last decade, image registration has proven to be a very active research area...
A benchmark library and a comparison of heuristic methods for the linear ordering problem
A benchmark library and a comparison of heuristic methods for the linear ordering problem
2012
The linear ordering problem consists of finding an acyclic tournament in a complete...
Tabu search for the linear ordering problem with cumulative costs
Tabu search for the linear ordering problem with cumulative costs
2011
Given a matrix of weights, the Linear Ordering Problem (LOP) consists of finding a...
Adaptive memory programming for matrix bandwidth minimization
Adaptive memory programming for matrix bandwidth minimization
2011
In this paper we explore the influence of adaptive memory in the performance of...
Hybrid scatter tabu search for unconstrained global optimization
Hybrid scatter tabu search for unconstrained global optimization
2011
The problem of finding a global optimum of an unconstrained multimodal function has...
Adaptive memory programming for constrained global optimization
Adaptive memory programming for constrained global optimization
2010
The problem of finding a global optimum of a constrained multimodal function has been...
Hybrid heuristics for the maximum diversity problem
Hybrid heuristics for the maximum diversity problem
2009
The maximum diversity problem presents a challenge to solution methods based on...
Advanced Scatter Search for the Max-Cut Problem
Advanced Scatter Search for the Max-Cut Problem
2009
The max–cut problem consists of finding a partition of the nodes of a weighted...
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
2007
We describe the development and testing of a metaheuristic procedure, based on the...
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
2007
We develop a greedy randomized adaptive search procedure (GRASP) for the constrained...
Scatter Search for the Point-Matching Problem in 3D Image Registration
Scatter Search for the Point-Matching Problem in 3D Image Registration
2008
Scatter search is a population–based method that has recently been shown to...
Adaptive memory programming for the robust capacitated international sourcing problem
Adaptive memory programming for the robust capacitated international sourcing problem
2008
The International Sourcing Problem consists of selecting a subset from an available...
Tabu search and GRASP for the maximum diversity problem
Tabu search and GRASP for the maximum diversity problem
2007
In this paper, we develop new heuristic procedures for the maximum diversity problem....
Variable neighborhood search for the linear ordering problem
Variable neighborhood search for the linear ordering problem
2006
Given a matrix of weights, the linear ordering problem (LOP) consists of finding a...
Context-independent scatter and tabu search for permutation problems
Context-independent scatter and tabu search for permutation problems
2005
In this paper, we develop a general-purpose heuristic for permutations problems. The...
Principles of scatter search
Principles of scatter search
2006
Scatter search is an evolutionary method that has been successfully applied to hard...
Papers per page: