Duarte Abraham

Abraham Duarte

Information about the author Abraham Duarte will soon be added to the site.
Found 15 papers in total
General Variable Neighborhood Search for computing graph separators
General Variable Neighborhood Search for computing graph separators
2017
Computing graph separators in networks has a wide range of real‐world...
Parallel variable neighborhood search for the min‐max order batching problem
Parallel variable neighborhood search for the min‐max order batching problem
2017
Warehousing is a key part of supply chain management. It primarily focuses on...
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...
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...
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...
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...
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....
Papers per page: