Elena Fernández
Orcid: 0000-0003-4714-0257
According to our database1,
Elena Fernández
authored at least 70 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Transp. Sci., 2024
2023
Connected graph partitioning with aggregated and non-aggregated gap objective functions.
Networks, December, 2023
Expert Syst. Appl., December, 2023
CoRR, 2023
2022
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption.
Transp. Sci., 2022
Eur. J. Oper. Res., 2022
The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms.
Comput. Oper. Res., 2022
2020
2019
Transp. Sci., 2019
New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation.
Eur. J. Oper. Res., 2019
2018
Transp. Sci., 2018
Comput. Oper. Res., 2018
2017
INFORMS J. Comput., 2017
Eur. J. Oper. Res., 2017
A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem.
Eur. J. Oper. Res., 2017
Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods.
Eur. J. Oper. Res., 2017
2016
Int. Trans. Oper. Res., 2016
2015
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem.
Comput. Oper. Res., 2015
2014
Ordered weighted average combinatorial optimization: Formulations and their properties.
Discret. Appl. Math., 2014
Comput. Oper. Res., 2014
2013
J. Heuristics, 2013
Fix-and-Relax-Coordination for a multi-period location-allocation problem under uncertainty.
Comput. Oper. Res., 2013
2012
General network design: A unified view of combined location and network design problems.
Eur. J. Oper. Res., 2012
Ann. Oper. Res., 2012
2011
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment.
INFORMS J. Comput., 2011
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem.
Comput. Oper. Res., 2011
2010
A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive.
J. Oper. Res. Soc., 2010
Eur. J. Oper. Res., 2010
Comput. Stat., 2010
2009
Lagrangean relaxation for the capacitated hub location problem with single assignment.
OR Spectr., 2009
A reactive GRASP for a commercial territory design problem with multiple balancing requirements.
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
2008
Comput. Oper. Res., 2008
2007
Math. Comput. Model., 2007
Eur. J. Oper. Res., 2007
2006
Eur. J. Oper. Res., 2006
Eur. J. Oper. Res., 2006
2005
Comput. Oper. Res., 2005
2004
J. Comb. Optim., 2004
2003
Oper. Res., 2003
Eur. J. Oper. Res., 2003
Decis. Support Syst., 2003
2002
A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem.
J. Oper. Res. Soc., 2002
J. Oper. Res. Soc., 2002
2001
Eur. J. Oper. Res., 2001
1999
J. Heuristics, 1999
1998
Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths.
Oper. Res., 1998
1994