Partial cover and complete cover inequalities. - Elena Fernández 001; Kurt Jørnsten (Oper. Res. Lett., 1994)

Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths. - Elena Fernández 001; Robert S. Garfinkel; Román Arbiol (Oper. Res., 1998)

GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps. - Elena Fernández 001; Rafael Martí (J. Heuristics, 1999)

A Tabu search heuristic for the generalized assignment problem. - Juan A. Díaz 002; Elena Fernández 001 (Eur. J. Oper. Res., 2001)

Heuristic solutions to the problem of routing school buses with multiple objectives. - Ángel Corberán; Elena Fernández 001; Manuel Laguna; Rafael Martí (J. Oper. Res. Soc., 2002)

A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem. - Juan A. Díaz 002; Elena Fernández 001 (J. Oper. Res. Soc., 2002)

Design of an interactive spell checker: optimizing the list of offered words. - Robert S. Garfinkel; Elena Fernández 001; Ram D. Gopal (Decis. Support Syst., 2003)

Multiobjective solution of the uncapacitated plant location problem. - Elena Fernández 001; Justo Puerto (Eur. J. Oper. Res., 2003)

On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation. - Elena Fernández 001; Oscar Meza; Robert S. Garfinkel; Maruja Ortega (Oper. Res., 2003)

Even Cycles and Perfect Matching Problems with Side Constraints. - Elena Fernández 001; Oscar Meza (J. Comb. Optim., 2004)

Filtering Policies in Loss Queuing Network Location Problems. - Elena Fernández 001; Yolanda Hinojosa; Justo Puerto (Ann. Oper. Res., 2005)

A compact model and tight bounds for a combined location-routing problem. - Maria Albareda-Sambola; Juan A. Díaz 002; Elena Fernández 001 (Comput. Oper. Res., 2005)

Privatized rural postman problems. - Julián Aráoz; Elena Fernández 001; Cristina Zoltan (Comput. Oper. Res., 2006)

Exact solutions to a class of stochastic generalized assignment problems. - Maria Albareda-Sambola; Maarten H. van der Vlerk; Elena Fernández 001 (Eur. J. Oper. Res., 2006)

Hybrid scatter search and path relinking for the capacitated p. - Juan A. Díaz 002; Elena Fernández 001 (Eur. J. Oper. Res., 2006)

Heuristic and lower bound for a stochastic location-routing problem. - Maria Albareda-Sambola; Elena Fernández 001; Gilbert Laporte (Eur. J. Oper. Res., 2007)

Empowering financial tradeoff with joint financial and supply chain planning models. - Mariana Badell; Elena Fernández 001; Gonzalo Guillén 001; Luis Puigjaner (Math. Comput. Model., 2007)

Solving an urban waste collection problem using ants heuristics. - Joaquín Bautista; Elena Fernández 001; Jordi Pereira (Comput. Oper. Res., 2008)

The multi-period incremental service facility location problem. - Maria Albareda-Sambola; Elena Fernández 001; Yolanda Hinojosa; Justo Puerto (Comput. Oper. Res., 2009)

The capacity and distance constrained plant location problem. - Maria Albareda-Sambola; Elena Fernández 001; Gilbert Laporte (Comput. Oper. Res., 2009)

Tight bounds from a path based formulation for the tree of hub location problem. - Iván A. Contreras; Elena Fernández 001; Alfredo Marín 001 (Comput. Oper. Res., 2009)

A reactive GRASP for a commercial territory design problem with multiple balancing requirements. - Roger Z. Ríos-Mercado; Elena Fernández 001 (Comput. Oper. Res., 2009)

Solving the Prize-collecting Rural Postman Problem. - Julián Aráoz; Elena Fernández 001; Oscar Meza (Eur. J. Oper. Res., 2009)

Lagrangean relaxation for the capacitated hub location problem with single assignment. - Iván A. Contreras; Juan A. Díaz 002; Elena Fernández 001 (OR Spectr., 2009)

The Clustered Prize-Collecting Arc Routing Problem. - Julián Aráoz; Elena Fernández 001; Carles Franquesa (Transp. Sci., 2009)

GEVA: geometric variability-based approaches for identifying patterns in data. - Itziar Irigoien; Concepción Arenas; Elena Fernández 001; Francisco Mestres (Comput. Stat., 2010)

Lagrangean duals and exact solution to the capacitated p-center problem. - Maria Albareda-Sambola; Juan A. Díaz 002; Elena Fernández 001 (Eur. J. Oper. Res., 2010)

The Tree of Hubs Location Problem. - Iván A. Contreras; Elena Fernández 001; Alfredo Marín 001 (Eur. J. Oper. Res., 2010)

A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive. - Elena Fernández 001; Jörg Kalcsics; Stefan Nickel; Roger Z. Ríos-Mercado (J. Oper. Res. Soc., 2010)

A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem. - Maria Albareda-Sambola; Elena Fernández 001; Gilbert Laporte (Comput. Oper. Res., 2011)

Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment. - Iván A. Contreras; Juan A. Díaz 002; Elena Fernández 001 (INFORMS J. Comput., 2011)

The Windy Clustered Prize-Collecting Arc-Routing Problem. - Angel Corberán; Elena Fernández 001; Carles Franquesa; José María Sanchis (Transp. Sci., 2011)

Preface: Operations research and systems (ALIO/INFORMS Joint International Meeting). - Roger Z. Ríos-Mercado; Elena Fernández 001; José Luis González Velarde; Lorena Pradenas (Ann. Oper. Res., 2012)

Multiperiod Location-Routing with Decoupled Time Scales. - Maria Albareda-Sambola; Elena Fernández 001; Stefan Nickel (Eur. J. Oper. Res., 2012)

General network design: A unified view of combined location and network design problems. - Iván A. Contreras; Elena Fernández 001 (Eur. J. Oper. Res., 2012)

On discrete optimization with ordering. - Elena Fernández 001; Justo Puerto; Antonio M. Rodríguez-Chía (Ann. Oper. Res., 2013)

Fix-and-Relax-Coordination for a multi-period location-allocation problem under uncertainty. - Maria Albareda-Sambola; Antonio Alonso-Ayuso; Laureano F. Escudero; Elena Fernández 001; Celeste Pizarro (Comput. Oper. Res., 2013)

GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem. - Julián Aráoz; Elena Fernández 001; Carles Franquesa (J. Heuristics, 2013)

The dynamic multiperiod vehicle routing problem with probabilistic information. - Maria Albareda-Sambola; Elena Fernández 001; Gilbert Laporte (Comput. Oper. Res., 2014)

Ordered weighted average combinatorial optimization: Formulations and their properties. - Elena Fernández 001; Miguel A. Pozo 001; Justo Puerto (Discret. Appl. Math., 2014)

Hub Location as the Minimization of a Supermodular Set Function. - Iván A. Contreras; Elena Fernández 001 (Oper. Res., 2014)

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. - Efrain Ruiz; Maria Albareda-Sambola; Elena Fernández 001; Mauricio G. C. Resende (Comput. Oper. Res., 2015)

On the Collaboration Uncapacitated Arc Routing Problem. - Elena Fernández 001; Dario Fontana; M. Grazia Speranza (Comput. Oper. Res., 2016)

Scheduling policies for multi-period services. - Cristina Núñez-del-Toro; Elena Fernández 001; Jörg Kalcsics; Stefan Nickel (Eur. J. Oper. Res., 2016)

A novel model for arc territory design: promoting Eulerian districts. - Gabriela García-Ayala; José Luis González Velarde; Roger Z. Ríos-Mercado; Elena Fernández 001 (Int. Trans. Oper. Res., 2016)

The Flexible Periodic Vehicle Routing Problem. - Claudia Archetti; Elena Fernández 001; Diana L. Huerta-Muñoz (Comput. Oper. Res., 2017)

Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods. - Víctor Blanco; Elena Fernández 001; Justo Puerto (Eur. J. Oper. Res., 2017)

A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem. - Elena Fernández 001; Jörg Kalcsics; Cristina Núñez-del-Toro (Eur. J. Oper. Res., 2017)

Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem. - Elena Fernández 001; Miguel A. Pozo 001; Justo Puerto; Andrea Scozzari (Eur. J. Oper. Res., 2017)

Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands. - Maria Albareda-Sambola; Elena Fernández 001; Francisco Saldanha-da-Gama (INFORMS J. Comput., 2017)

A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem. - Claudia Archetti; Elena Fernández 001; Diana L. Huerta-Muñoz (Comput. Oper. Res., 2018)

Exact solution of hub network design problems with profits. - Armaghan Alibeyg; Iván A. Contreras; Elena Fernández 001 (Eur. J. Oper. Res., 2018)

The Shared Customer Collaboration Vehicle Routing Problem. - Elena Fernández 001; Mireia Roca-Riu; M. Grazia Speranza (Eur. J. Oper. Res., 2018)

A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem. - Elena Fernández 001; Gilbert Laporte; Jessica Rodríguez-Pereira (Transp. Sci., 2018)

Location routing problems on trees. - Julián Aráoz; Elena Fernández 001; Salvador Rueda (Discret. Appl. Math., 2019)

New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation. - Elena Fernández 001; Yolanda Hinojosa; Justo Puerto; Francisco Saldanha-da-Gama (Eur. J. Oper. Res., 2019)

The Steiner Traveling Salesman Problem and its extensions. - Jessica Rodríguez-Pereira; Elena Fernández 001; Gilbert Laporte; Enrique Benavent; Antonio Martinez-Sykora (Eur. J. Oper. Res., 2019)

Solving the optimum communication spanning tree problem. - Carlos Armando Zetina; Iván A. Contreras; Elena Fernández 001; Carlos Luna-Mota (Eur. J. Oper. Res., 2019)

Exact Solution of Several Families of Location-Arc Routing Problems. - Elena Fernández 001; Gilbert Laporte; Jessica Rodríguez-Pereira (Transp. Sci., 2019)

On the fuzzy maximal covering location problem. - Manuel Arana-Jiménez; Víctor Blanco; Elena Fernández 001 (Eur. J. Oper. Res., 2020)

On carriers collaboration in hub location problems. - Elena Fernández 001; Antonino Sgalambro (Eur. J. Oper. Res., 2020)

The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms. - Diana L. Huerta-Muñoz; Claudia Archetti; Elena Fernández 001; Federico Perea (Comput. Oper. Res., 2022)

New formulations and solutions for the strategic berth template problem. - Elena Fernández 001; Manuel Muñoz-Márquez (Eur. J. Oper. Res., 2022)

Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. - Elena Fernández 001; Markus Leitner; Ivana Ljubic; Mario Ruthmair (Transp. Sci., 2022)

Outsourcing policies for the Facility Location Problem with Bernoulli Demand. - Maria Albareda-Sambola; Elena Fernández 001; Francisco Saldanha-da-Gama (CoRR, 2023)

Hub Location with Protection Under Interhub Link Failures. - Víctor Blanco; Elena Fernández 001; Yolanda Hinojosa (INFORMS J. Comput., 2023)

Using the ℓ1-norm for Image-based tomographic reconstruction. - José J. Calvino; Elena Fernández 001; Miguel López-Haro; Juan Manuel Muñoz-Ocaña; Antonio M. Rodríguez-Chía (Expert Syst. Appl., 2023)

Connected graph partitioning with aggregated and non-aggregated gap objective functions. - Elena Fernández 001; Isabella Lari; Justo Puerto; Federica Ricca; Andrea Scozzari (Networks, 2023)

Hub location with congestion and time-sensitive demand. - Carmen-Ana Domínguez-Bravo; Elena Fernández 001; Armin Lüer-Villagra (Eur. J. Oper. Res., 2024)

A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery. - Martina Cerulli; Claudia Archetti; Elena Fernández 001; Ivana Ljubic (Transp. Sci., 2024)

On the (k,ℓ)-multiset anonymity measure for social graphs. - Alejandro Estrada-Moreno; Elena Fernández 001; Dorota Kuziak; Manuel Muñoz-Márquez; Rolando Trujillo-Rasua; Ismael G. Yero (CoRR, 2025)

On the periodic service scheduling problem with non-uniform demands. - Elena Fernández 001; Jörg Kalcsics (Comput. Oper. Res., 2026)