Anna Martínez-Gavara

Orcid: 0000-0001-9995-010X

According to our database1, Anna Martínez-Gavara authored at least 24 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem.
Proceedings of the Metaheuristics - 15th International Conference, 2024

Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination Problem.
Proceedings of the Metaheuristics - 15th International Conference, 2024

2023
Solution-based tabu search for the capacitated dispersion problem.
Expert Syst. Appl., August, 2023

2022
Max-min dispersion with capacity and cost for a practical location problem.
Expert Syst. Appl., 2022

A review on discrete diversity and dispersion maximization from an OR perspective.
Eur. J. Oper. Res., 2022

An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2021
The capacitated dispersion problem: an optimization model and a memetic algorithm.
Memetic Comput., 2021

GRASP and tabu search for the generalized dispersion problem.
Expert Syst. Appl., 2021

2020
Tabu search for min-max edge crossing in graphs.
Comput. Oper. Res., 2020

2019
Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem.
J. Heuristics, 2019

Heuristics for the Constrained Incremental Graph Drawing Problem.
Eur. J. Oper. Res., 2019

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

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

2017
Heuristic solution approaches for the maximum minsum dispersion problem.
J. Glob. Optim., 2017

Randomized heuristics for the Capacitated Clustering Problem.
Inf. Sci., 2017

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

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

Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem.
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017

2015
Tabu search and GRASP for the capacitated clustering problem.
Comput. Optim. Appl., 2015

2014
Well-Balanced Adaptive Mesh Refinement for shallow water flows.
J. Comput. Phys., 2014

2013
A Continuous Approach to FETI-DP Mortar Methods: Application to Dirichlet and Stokes Problem.
Proceedings of the Domain Decomposition Methods in Science and Engineering XX, 2013

2011
On stability issues for IMEX schemes applied to 1D scalar hyperbolic equations with stiff reaction terms.
Math. Comput., 2011

A Hybrid Second Order Scheme for Shallow Water Flows.
J. Sci. Comput., 2011

Hybrid Second Order Schemes for Scalar Balance Laws.
J. Sci. Comput., 2011


  Loading...