Elena Fernández

Orcid: 0000-0003-4714-0257

Affiliations:
  • University of Cádiz, Department of Statistics and Operational Research, Puerto Real, Spain
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Elena Fernández authored at least 70 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery.
Transp. Sci., 2024

Hub location with congestion and time-sensitive demand.
Eur. J. Oper. Res., 2024

2023
Connected graph partitioning with aggregated and non-aggregated gap objective functions.
Networks, December, 2023

Using the ℓ1-norm for Image-based tomographic reconstruction.
Expert Syst. Appl., December, 2023

Hub Location with Protection Under Interhub Link Failures.
INFORMS J. Comput., 2023

Outsourcing policies for the Facility Location Problem with Bernoulli Demand.
CoRR, 2023

2022
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption.
Transp. Sci., 2022

New formulations and solutions for the strategic berth template problem.
Eur. J. Oper. Res., 2022

The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms.
Comput. Oper. Res., 2022

2020
On carriers collaboration in hub location problems.
Eur. J. Oper. Res., 2020

On the fuzzy maximal covering location problem.
Eur. J. Oper. Res., 2020

2019
Exact Solution of Several Families of Location-Arc Routing Problems.
Transp. Sci., 2019

Solving the optimum communication spanning tree problem.
Eur. J. Oper. Res., 2019

The Steiner Traveling Salesman Problem and its extensions.
Eur. J. Oper. Res., 2019

New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation.
Eur. J. Oper. Res., 2019

Location routing problems on trees.
Discret. Appl. Math., 2019

2018
A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem.
Transp. Sci., 2018

The Shared Customer Collaboration Vehicle Routing Problem.
Eur. J. Oper. Res., 2018

Exact solution of hub network design problems with profits.
Eur. J. Oper. Res., 2018

A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem.
Comput. Oper. Res., 2018

2017
Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands.
INFORMS J. Comput., 2017

Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem.
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

The Flexible Periodic Vehicle Routing Problem.
Comput. Oper. Res., 2017

2016
A novel model for arc territory design: promoting Eulerian districts.
Int. Trans. Oper. Res., 2016

Scheduling policies for multi-period services.
Eur. J. Oper. Res., 2016

On the Collaboration Uncapacitated Arc Routing Problem.
Comput. Oper. Res., 2016

2015
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem.
Comput. Oper. Res., 2015

2014
Hub Location as the Minimization of a Supermodular Set Function.
Oper. Res., 2014

Ordered weighted average combinatorial optimization: Formulations and their properties.
Discret. Appl. Math., 2014

The dynamic multiperiod vehicle routing problem with probabilistic information.
Comput. Oper. Res., 2014

2013
GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem.
J. Heuristics, 2013

Fix-and-Relax-Coordination for a multi-period location-allocation problem under uncertainty.
Comput. Oper. Res., 2013

On discrete optimization with ordering.
Ann. Oper. Res., 2013

2012
General network design: A unified view of combined location and network design problems.
Eur. J. Oper. Res., 2012

Multiperiod Location-Routing with Decoupled Time Scales.
Eur. J. Oper. Res., 2012

Preface: Operations research and systems (ALIO/INFORMS Joint International Meeting).
Ann. Oper. Res., 2012

2011
The Windy Clustered Prize-Collecting Arc-Routing Problem.
Transp. Sci., 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

The Tree of Hubs Location Problem.
Eur. J. Oper. Res., 2010

Lagrangean duals and exact solution to the capacitated p-center problem.
Eur. J. Oper. Res., 2010

GEVA: geometric variability-based approaches for identifying patterns in data.
Comput. Stat., 2010

2009
The Clustered Prize-Collecting Arc Routing Problem.
Transp. Sci., 2009

Lagrangean relaxation for the capacitated hub location problem with single assignment.
OR Spectr., 2009

Solving the Prize-collecting Rural Postman Problem.
Eur. J. Oper. Res., 2009

A reactive GRASP for a commercial territory design problem with multiple balancing requirements.
Comput. Oper. Res., 2009

Tight bounds from a path based formulation for the tree of hub location problem.
Comput. Oper. Res., 2009

The capacity and distance constrained plant location problem.
Comput. Oper. Res., 2009

The multi-period incremental service facility location problem.
Comput. Oper. Res., 2009

2008
Solving an urban waste collection problem using ants heuristics.
Comput. Oper. Res., 2008

2007
Empowering financial tradeoff with joint financial and supply chain planning models.
Math. Comput. Model., 2007

Heuristic and lower bound for a stochastic location-routing problem.
Eur. J. Oper. Res., 2007

2006
Hybrid scatter search and path relinking for the capacitated p.
Eur. J. Oper. Res., 2006

Exact solutions to a class of stochastic generalized assignment problems.
Eur. J. Oper. Res., 2006

Privatized rural postman problems.
Comput. Oper. Res., 2006

2005
A compact model and tight bounds for a combined location-routing problem.
Comput. Oper. Res., 2005

Filtering Policies in Loss Queuing Network Location Problems.
Ann. Oper. Res., 2005

2004
Even Cycles and Perfect Matching Problems with Side Constraints.
J. Comb. Optim., 2004

2003
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation.
Oper. Res., 2003

Multiobjective solution of the uncapacitated plant location problem.
Eur. J. Oper. Res., 2003

Design of an interactive spell checker: optimizing the list of offered words.
Decis. Support Syst., 2003

2002
A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem.
J. Oper. Res. Soc., 2002

Heuristic solutions to the problem of routing school buses with multiple objectives.
J. Oper. Res. Soc., 2002

2001
A Tabu search heuristic for the generalized assignment problem.
Eur. J. Oper. Res., 2001

1999
GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps.
J. Heuristics, 1999

1998
Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths.
Oper. Res., 1998

1994
Partial cover and complete cover inequalities.
Oper. Res. Lett., 1994


  Loading...