Abraham Duarte

According to our database1, Abraham Duarte authored at least 97 papers between 2004 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Solving the edge-disjoint paths problem using a two-stage method.
Int. Trans. Oper. Res., 2020

A parallel variable neighborhood search approach for the obnoxious p-median problem.
Int. Trans. Oper. Res., 2020

Basic variable neighborhood search for the minimum sitting arrangement problem.
J. Heuristics, 2020

Special issue on recent innovations in variable neighborhood search.
J. Heuristics, 2020

2019
A variable neighborhood search approach for the vertex bisection problem.
Inf. Sci., 2019

Alternative evaluation functions for the cyclic bandwidth sum problem.
Eur. J. Oper. Res., 2019

A Variable Neighborhood Search approach for the Hamiltonian p-median problem.
Appl. Soft Comput., 2019

Basic VNS for a Variant of the Online Order Batching Problem.
Proceedings of the Variable Neighborhood Search - 7th International Conference, 2019

2018
Diversity and Equity Models.
Proceedings of the Handbook of Heuristics., 2018

Linear Layout Problems.
Proceedings of the Handbook of Heuristics., 2018

Variable Neighborhood Descent.
Proceedings of the Handbook of Heuristics., 2018

Scatter search for the bi-criteria p-median p-dispersion problem.
Prog. Artif. Intell., 2018

Multi-objective memetic optimization for the bi-objective obnoxious <i>p</i>-median problem.
Knowl. Based Syst., 2018

Iterated Greedy algorithm for performing community detection in social networks.
Future Gener. Comput. Syst., 2018

Heuristics for the Bi-Objective Diversity Problem.
Expert Syst. Appl., 2018

Tabu search for the dynamic Bipartite Drawing Problem.
Comput. Oper. Res., 2018

GRASP with Path Relinking for 2D-Bandwidth Minimization Problem.
Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications, 2018

A Metaheuristic Approach for the \alpha α -separator Problem.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2018, 2018

Finding Balanced Bicliques in Bipartite Graphs Using Variable Neighborhood Search.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

Detecting Weak Points in Networks Using Variable Neighborhood Search.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

New VNS Variants for the Online Order Batching Problem.
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

2017
General Variable Neighborhood Search for computing graph separators.
Optim. Lett., 2017

Parallel variable neighborhood search for the min-max order batching problem.
Int. Trans. Oper. Res., 2017

General Variable Neighborhood Search for the Order Batching and Sequencing Problem.
Eur. J. Oper. Res., 2017

Variable neighborhood descent for the incremental graph drawing.
Electron. Notes Discret. Math., 2017

Variable Neighborhood Search strategies for the Order Batching Problem.
Comput. Oper. Res., 2017

Special issue on Variable neighborhood search methods in business and engineering.
Comput. Oper. Res., 2017

Variable neighborhood scatter search for the incremental graph drawing problem.
Comput. Optim. Appl., 2017

Improving the performance of embedded systems with variable neighborhood search.
Appl. Soft Comput., 2017

2016
Parallel strategic oscillation: an application to the maximum leaf spanning tree problem.
Prog. Artif. Intell., 2016

GRASP with path relinking for the single row facility layout problem.
Knowl. Based Syst., 2016

Scatter search for the bandpass problem.
J. Global Optimization, 2016

Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem.
Int. J. Comput. Intell. Syst., 2016

Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem.
Eur. J. Oper. Res., 2016

Estimating the Spanish Energy Demand Using Variable Neighborhood Search.
Proceedings of the Advances in Artificial Intelligence, 2016

2015
Scatter search for the profile minimization problem.
Networks, 2015

Tabu search for the Max-Mean Dispersion Problem.
Knowl. Based Syst., 2015

Multi-objective variable neighborhood search: an application to combinatorial optimization problems.
J. Global Optimization, 2015

Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.
Inf. Sci., 2015

Multiobjective GRASP with Path Relinking.
Eur. J. Oper. Res., 2015

Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies.
Electron. Notes Discret. Math., 2015

General Variable Neighborhood Search applied to the picking process in a warehouse.
Electron. Notes Discret. Math., 2015

VNS variants for the Max-Mean Dispersion Problem.
Electron. Notes Discret. Math., 2015

Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem.
Proceedings of the Advances in Artificial Intelligence, 2015

2014
GRASP with ejection chains for the dynamic memory allocation in embedded systems.
Soft Comput., 2014

GRASP with path relinking for the orienteering problem.
J. Oper. Res. Soc., 2014

A black-box scatter search for optimization problems with integer variables.
J. Global Optimization, 2014

Improved heuristics for the regenerator location problem.
Int. Trans. Oper. Res., 2014

Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem.
Comput. Oper. Res., 2014

Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem.
Comput. Oper. Res., 2014

2013
Low-Level Hybridization of Scatter Search and Particle Filter for Dynamic TSP Solving.
Proceedings of the Metaheuristics for Dynamic Optimization, 2013

Designing effective improvement methods for scatter search: an experimental study on global optimization.
Soft Comput., 2013

A hybrid metaheuristic for the cyclic antibandwidth problem.
Knowl. Based Syst., 2013

Tabu search with strategic oscillation for the maximally diverse grouping problem.
J. Oper. Res. Soc., 2013

Heuristics and metaheuristics for the maximum diversity problem.
J. Heuristics, 2013

Branch and bound for the cutwidth minimization problem.
Comput. Oper. Res., 2013

Variable Formulation Search for the Cutwidth Minimization Problem.
Appl. Soft Comput., 2013

URJC&UNED at ImageCLEF 2013 Photo Annotation Task.
Proceedings of the Working Notes for CLEF 2013 Conference , 2013

2012
Mejorando el acceso, el análisis y la visibilidad de la Información y los contenidos Multilingues y Multimedia en Red para la Comunidad de Madrid.
Procesamiento del Lenguaje Natural, 2012

GRASP with Path Relinking for the SumCut Problem.
IJCOPI, 2012

Variable neighborhood search with ejection chains for the antibandwidth problem.
J. Heuristics, 2012

Metaheuristics for the linear ordering problem with cumulative costs.
Eur. J. Oper. Res., 2012

An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems.
Electron. Notes Discret. Math., 2012

A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem.
Electron. Notes Discret. Math., 2012

Variable neighborhood search for the Vertex Separation Problem.
Comput. Oper. Res., 2012

A benchmark library and a comparison of heuristic methods for the linear ordering problem.
Comput. Optim. Appl., 2012

Scatter search for the cutwidth minimization problem.
Annals OR, 2012

URJCyUNED at ImageCLEF 2012 Photo Annotation Task.
Proceedings of the CLEF 2012 Evaluation Labs and Workshop, 2012

2011
Path relinking for large-scale global optimization.
Soft Comput., 2011

GRASP with path relinking heuristics for the antibandwidth problem.
Networks, 2011

Scatter Search and Path Relinking : A Tutorial on the Linear Arrangement Problem.
IJSIR, 2011

Pseudo-Cut Strategies for Global Optimization.
Int. J. of Applied Metaheuristic Computing, 2011

Tabu search for the linear ordering problem with cumulative costs.
Comput. Optim. Appl., 2011

Hybrid scatter tabu search for unconstrained global optimization.
Annals OR, 2011

2010
Heuristics for the bandwidth colouring problem.
IJMHeur, 2010

A branch and bound algorithm for the maximum diversity problem.
Eur. J. Oper. Res., 2010

GRASP and path relinking for the max-min diversity problem.
Comput. Oper. Res., 2010

Adaptive memory programming for constrained global optimization.
Comput. Oper. Res., 2010

Black box scatter search for general classes of binary optimization problems.
Comput. Oper. Res., 2010

Improving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC).
Proceedings of the Knowledge-Based and Intelligent Information and Engineering Systems, 2010

GRASP for Instance Selection in Medical Data Sets.
Proceedings of the Advances in Bioinformatics, 2010

2009
Advanced Scatter Search for the Max-Cut Problem.
INFORMS J. Comput., 2009

Heuristics for the bi-objective path dissimilarity problem.
Comput. Oper. Res., 2009

Hybridizing the cross-entropy method: An application to the max-cut problem.
Comput. Oper. Res., 2009

Hybrid heuristics for the maximum diversity problem.
Comput. Optim. Appl., 2009

An Adaptive Memory Procedure for Continuous Optimization.
Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications, 2009

2008
Multi-dimensional visual tracking using scatter search particle filter.
Pattern Recognit. Lett., 2008

2007
Tabu search and GRASP for the maximum diversity problem.
Eur. J. Oper. Res., 2007

Agile Commitments: A MDE Approach for Language Engineering.
Proceedings of the ENASE 2007, 2007

Representing Languages in UML - A UML Profile for Language Engineering.
Proceedings of the ENASE 2007, 2007

2006
Improving image segmentation quality through effective region merging using a hierarchical social metaheuristic.
Pattern Recognit. Lett., 2006

2005
A low-level hybridization between memetic algorithm and VNS for the max-cut problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2005

Region Merging for Severe Oversegmented Images Using a Hierarchical Social Metaheuristic.
Proceedings of the Applications of Evolutionary Computing, 2005

2004
Path Relinking Particle Filter for Human Body Pose Estimation.
Proceedings of the Structural, 2004

Top-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic.
Proceedings of the Applications of Evolutionary Computing, 2004

A Hierarchical Social Metaheuristic for the Max-Cut Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2004


  Loading...