Mart Rafael

Rafael Mart

Information about the author Rafael Mart will soon be added to the site.
Found 39 papers in total
Path relinking and the generalised reduced gradient method for artificial neural networks
Path relinking and the generalised reduced gradient method for artificial neural networks
2006
Artificial neural networks (ANN) have been widely used for both classification and...
Approximating unknown mappings: An experimental evaluation
Approximating unknown mappings: An experimental evaluation
2005
Different methodologies have been introduced in recent years with the aim of...
Experimental testing of advanced scatter search designs for global optimization of multimodal functions
Experimental testing of advanced scatter search designs for global optimization of multimodal functions
2005
Scatter search is an evolutionary method that, unlike genetic algorithms, operates on...
A greedy randomized adaptive search procedure and path relinking for the matrix bandwidth minimization
A greedy randomized adaptive search procedure and path relinking for the matrix bandwidth minimization
2004
In this article we develop a greedy randomized adaptive search procedure (GRASP) for...
Multilayer neural networks: an experimental evaluation of on-line training methods
Multilayer neural networks: an experimental evaluation of on-line training methods
2004
Artificial neural networks (ANN) are inspired by the structure of biological neural...
The rural postman problem on mixed graphs with turn penalties
The rural postman problem on mixed graphs with turn penalties
2002
In this paper we deal with a problem which generalizes the Rural Postman Problem...
Incremental bipartite drawing problem
Incremental bipartite drawing problem
2001
Layout strategies that strive to preserve perspective from earlier drawings are called...
Reducing the bandwidth of a sparse matrix with tabu search
Reducing the bandwidth of a sparse matrix with tabu search
2001
The bandwidth of a matrix A= { a ij } is defined as the maximum absolute difference...
Heuristics for the mixed rural postman problem
Heuristics for the mixed rural postman problem
2000
The Rural Postman Problem on a mixed graph (MRPP) consists of finding a minimum cost...
A heuristic algorithm for project scheduling with splitting allowed
A heuristic algorithm for project scheduling with splitting allowed
1996
In this article, we analyze the precedence diagramming method, the only published...
GRASP and path relinking for 2-layer straight line crossing minimization
GRASP and path relinking for 2-layer straight line crossing minimization
1999
In this article, we develop a greedy randomized adaptive search procedure for the...
A tabu search algorithm for the bipartite drawing problem
A tabu search algorithm for the bipartite drawing problem
1998
Graphs are used to represent reality in several areas of knowledge. This has generated...
A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
1996
Acyclic directed graphs are widely used in many fields of economic and social...
Arc crossing minimization in hierarchical digraphs with tabu search
Arc crossing minimization in hierarchical digraphs with tabu search
1997
Graphs are used commonly as a basic modeling tool in areas such as project management,...
A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
1996
Acyclic directed graphs are commonly used to model complex systems. The most important...
Papers per page: