default search action
Elena Fernández 0001
Person information
Other persons with the same name
- Elena Fernández
— University of Cádiz, Department of Statistics and Operational Research, Puerto Real, Spain (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j69]Carmen-Ana Domínguez-Bravo
Hub location with congestion and time-sensitive demand. Eur. J. Oper. Res. 316(3): 828-844 (2024) - [j68]Martina Cerulli
A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery. Transp. Sci. 58(5): 1076-1100 (2024) - 2023
- [j67]José J. Calvino
Using the ℓ1-norm for Image-based tomographic reconstruction. Expert Syst. Appl. 232: 120848 (2023) - [j66]Víctor Blanco
Hub Location with Protection Under Interhub Link Failures. INFORMS J. Comput. 35(5): 966-985 (2023) - [j65]Elena Fernández
Connected graph partitioning with aggregated and non-aggregated gap objective functions. Networks 82(4): 551-570 (2023) - [i1]Maria Albareda-Sambola, Elena Fernández, Francisco Saldanha-da-Gama
Outsourcing policies for the Facility Location Problem with Bernoulli Demand. CoRR abs/2310.18981 (2023) - 2022
- [j64]Diana L. Huerta-Muñoz
The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms. Comput. Oper. Res. 141: 105662 (2022) - [j63]Elena Fernández
New formulations and solutions for the strategic berth template problem. Eur. J. Oper. Res. 298(1): 99-117 (2022) - [j62]Elena Fernández
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. Transp. Sci. 56(5): 1219-1237 (2022) - 2020
- [j61]Elena Fernández, Antonino Sgalambro
On carriers collaboration in hub location problems. Eur. J. Oper. Res. 283(2): 476-490 (2020) - [j60]Manuel Arana-Jiménez
On the fuzzy maximal covering location problem. Eur. J. Oper. Res. 283(2): 692-705 (2020)
2010 – 2019
- 2019
- [j59]Julián Aráoz, Elena Fernández
Location routing problems on trees. Discret. Appl. Math. 259: 1-18 (2019) - [j58]Carlos Armando Zetina
Solving the optimum communication spanning tree problem. Eur. J. Oper. Res. 273(1): 108-117 (2019) - [j57]Elena Fernández
New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation. Eur. J. Oper. Res. 277(1): 215-226 (2019) - [j56]Jessica Rodríguez-Pereira
The Steiner Traveling Salesman Problem and its extensions. Eur. J. Oper. Res. 278(2): 615-628 (2019) - [j55]Elena Fernández
Exact Solution of Several Families of Location-Arc Routing Problems. Transp. Sci. 53(5): 1313-1333 (2019) - 2018
- [j54]Claudia Archetti
A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem. Comput. Oper. Res. 99: 27-37 (2018) - [j53]Elena Fernández
The Shared Customer Collaboration Vehicle Routing Problem. Eur. J. Oper. Res. 265(3): 1078-1093 (2018) - [j52]Armaghan Alibeyg, Iván A. Contreras
Exact solution of hub network design problems with profits. Eur. J. Oper. Res. 266(1): 57-71 (2018) - [j51]Elena Fernández
A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem. Transp. Sci. 52(2): 353-369 (2018) - 2017
- [j50]Claudia Archetti
The Flexible Periodic Vehicle Routing Problem. Comput. Oper. Res. 85: 58-70 (2017) - [j49]Elena Fernández
Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem. Eur. J. Oper. Res. 260(3): 886-903 (2017) - [j48]Víctor Blanco
Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods. Eur. J. Oper. Res. 262(3): 863-878 (2017) - [j47]Elena Fernández
A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem. Eur. J. Oper. Res. 263(3): 805-814 (2017) - [j46]Maria Albareda-Sambola
Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands. INFORMS J. Comput. 29(4): 737-753 (2017) - 2016
- [j45]Elena Fernández
On the Collaboration Uncapacitated Arc Routing Problem. Comput. Oper. Res. 67: 120-131 (2016) - [j44]Cristina Núñez-del-Toro
Scheduling policies for multi-period services. Eur. J. Oper. Res. 251(3): 751-770 (2016) - [j43]Gabriela García-Ayala, José Luis González Velarde, Roger Z. Ríos-Mercado
A novel model for arc territory design: promoting Eulerian districts. Int. Trans. Oper. Res. 23(3): 433-458 (2016) - 2015
- [j42]Efrain Ruiz, Maria Albareda-Sambola
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 57: 95-108 (2015) - 2014
- [j41]Maria Albareda-Sambola
The dynamic multiperiod vehicle routing problem with probabilistic information. Comput. Oper. Res. 48: 31-39 (2014) - [j40]Elena Fernández
Ordered weighted average combinatorial optimization: Formulations and their properties. Discret. Appl. Math. 169: 97-118 (2014) - [j39]Iván A. Contreras
Hub Location as the Minimization of a Supermodular Set Function. Oper. Res. 62(3): 557-570 (2014) - 2013
- [j38]Elena Fernández
On discrete optimization with ordering. Ann. Oper. Res. 207(1): 83-96 (2013) - [j37]Maria Albareda-Sambola
Fix-and-Relax-Coordination for a multi-period location-allocation problem under uncertainty. Comput. Oper. Res. 40(12): 2878-2892 (2013) - [j36]Julián Aráoz, Elena Fernández
GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem. J. Heuristics 19(2): 343-371 (2013) - 2012
- [j35]Roger Z. Ríos-Mercado
Preface: Operations research and systems (ALIO/INFORMS Joint International Meeting). Ann. Oper. Res. 199(1): 1-2 (2012) - [j34]Maria Albareda-Sambola
Multiperiod Location-Routing with Decoupled Time Scales. Eur. J. Oper. Res. 217(2): 248-258 (2012) - [j33]Iván A. Contreras
General network design: A unified view of combined location and network design problems. Eur. J. Oper. Res. 219(3): 680-697 (2012) - 2011
- [j32]Maria Albareda-Sambola
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem. Comput. Oper. Res. 38(8): 1109-1116 (2011) - [j31]Iván A. Contreras
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment. INFORMS J. Comput. 23(1): 41-55 (2011) - [j30]Angel Corberán
The Windy Clustered Prize-Collecting Arc-Routing Problem. Transp. Sci. 45(3): 317-334 (2011) - 2010
- [j29]Itziar Irigoien
GEVA: geometric variability-based approaches for identifying patterns in data. Comput. Stat. 25(2): 241-255 (2010) - [j28]Maria Albareda-Sambola
Lagrangean duals and exact solution to the capacitated p-center problem. Eur. J. Oper. Res. 201(1): 71-81 (2010) - [j27]Iván A. Contreras
The Tree of Hubs Location Problem. Eur. J. Oper. Res. 202(2): 390-400 (2010) - [j26]Elena Fernández
A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive. J. Oper. Res. Soc. 61(3): 503-514 (2010)
2000 – 2009
- 2009
- [j25]Maria Albareda-Sambola
The capacity and distance constrained plant location problem. Comput. Oper. Res. 36(2): 597-611 (2009) - [j24]Roger Z. Ríos-Mercado
A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Comput. Oper. Res. 36(3): 755-776 (2009) - [j23]Maria Albareda-Sambola
The multi-period incremental service facility location problem. Comput. Oper. Res. 36(5): 1356-1375 (2009) - [j22]Iván A. Contreras
Tight bounds from a path based formulation for the tree of hub location problem. Comput. Oper. Res. 36(12): 3117-3127 (2009) - [j21]Julián Aráoz, Elena Fernández
Solving the Prize-collecting Rural Postman Problem. Eur. J. Oper. Res. 196(3): 886-896 (2009) - [j20]Iván A. Contreras
Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectr. 31(3): 483-505 (2009) - [j19]Julián Aráoz, Elena Fernández
The Clustered Prize-Collecting Arc Routing Problem. Transp. Sci. 43(3): 287-300 (2009) - 2008
- [j18]Joaquín Bautista
Solving an urban waste collection problem using ants heuristics. Comput. Oper. Res. 35(9): 3020-3033 (2008) - 2007
- [j17]Maria Albareda-Sambola
Heuristic and lower bound for a stochastic location-routing problem. Eur. J. Oper. Res. 179(3): 940-955 (2007) - [j16]Mariana Badell, Elena Fernández
Empowering financial tradeoff with joint financial and supply chain planning models. Math. Comput. Model. 46(1-2): 12-23 (2007) - 2006
- [j15]Julián Aráoz, Elena Fernández
Privatized rural postman problems. Comput. Oper. Res. 33(12): 3432-3449 (2006) - [j14]Juan A. Díaz
Hybrid scatter search and path relinking for the capacitated p. Eur. J. Oper. Res. 169(2): 570-585 (2006) - [j13]Maria Albareda-Sambola
Exact solutions to a class of stochastic generalized assignment problems. Eur. J. Oper. Res. 173(2): 465-487 (2006) - 2005
- [j12]Elena Fernández
Filtering Policies in Loss Queuing Network Location Problems. Ann. Oper. Res. 136(1): 259-283 (2005) - [j11]Maria Albareda-Sambola
A compact model and tight bounds for a combined location-routing problem. Comput. Oper. Res. 32: 407-428 (2005) - 2004
- [j10]Elena Fernández
Even Cycles and Perfect Matching Problems with Side Constraints. J. Comb. Optim. 8(3): 381-396 (2004) - 2003
- [j9]Robert S. Garfinkel, Elena Fernández
Design of an interactive spell checker: optimizing the list of offered words. Decis. Support Syst. 35(3): 385-397 (2003) - [j8]Elena Fernández
Multiobjective solution of the uncapacitated plant location problem. Eur. J. Oper. Res. 145(3): 509-529 (2003) - [j7]Elena Fernández
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation. Oper. Res. 51(2): 281-291 (2003) - 2002
- [j6]Ángel Corberán, Elena Fernández
Heuristic solutions to the problem of routing school buses with multiple objectives. J. Oper. Res. Soc. 53(4): 427-435 (2002) - [j5]Juan A. Díaz
A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem. J. Oper. Res. Soc. 53(7): 728-740 (2002) - 2001
- [j4]Juan A. Díaz
A Tabu search heuristic for the generalized assignment problem. Eur. J. Oper. Res. 132(1): 22-38 (2001)
1990 – 1999
- 1999
- [j3]Elena Fernández, Rafael Martí
GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps. J. Heuristics 5(2): 181-197 (1999) - 1998
- [j2]Elena Fernández
Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths. Oper. Res. 46(3): 293-304 (1998) - 1994
- [j1]Elena Fernández
Partial cover and complete cover inequalities. Oper. Res. Lett. 15(1): 19-33 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: