Fernndez Elena

Elena Fernndez

Information about the author Elena Fernndez will soon be added to the site.
Found 25 papers in total
Multi-depot rural postman problems
Multi-depot rural postman problems
2017
This paper studies multi‐depot rural postman problems on an undirected graph....
On the Collaboration Uncapacitated Arc Routing Problem
On the Collaboration Uncapacitated Arc Routing Problem
2016
This paper introduces a new arc routing problem for the optimization of a...
A novel model for arc territory design: promoting Eulerian districts
A novel model for arc territory design: promoting Eulerian districts
2016
The problem of district design for the implementation of arc routing activities is...
On discrete optimization with ordering
On discrete optimization with ordering
2013
This paper studies discrete optimization problems with ordering requirements. These...
The maximum dispersion problem
The maximum dispersion problem
2013
In the maximum dispersion problem, a given set of objects has to be partitioned into a...
Minimizing the maximum travel time in a combined model of facility location and network design
Minimizing the maximum travel time in a combined model of facility location and network design
2012
This paper presents a combined Facility Location/Network Design Problem which...
General network design: A unified view of combined location and network design problems
General network design: A unified view of combined location and network design problems
2012
This paper presents a unified framework for the general network design problem which...
Multiperiod Location‐Routing with Decoupled Time Scales
Multiperiod Location‐Routing with Decoupled Time Scales
2012
This paper focuses on a multiperiod discrete facility location problem where...
The Windy Clustered Prize‐Collecting Arc‐Routing Problem
The Windy Clustered Prize‐Collecting Arc‐Routing Problem
2011
This paper introduces the windy clustered prize‐collecting arc‐routing...
Branch and Price for Large‐Scale Capacitated Hub Location Problems with Single Assignment
Branch and Price for Large‐Scale Capacitated Hub Location Problems with Single Assignment
2011
This paper presents a branch‐and‐price algorithm for the capacitated hub...
The Single Period Coverage Facility Location Problem: Lagrangean heuristic and column generation approaches
The Single Period Coverage Facility Location Problem: Lagrangean heuristic and column generation approaches
2010
In this paper we introduce the Single Period Coverage Facility Location Problem. It is...
A computational comparison of several formulations for the multi-period incremental service facility location problem
A computational comparison of several formulations for the multi-period incremental service facility location problem
2010
The Multi-period Incremental Service Facility Location Problem, which was recently...
Lagrangean bounds for the optimum communication spanning tree problem
Lagrangean bounds for the optimum communication spanning tree problem
2010
This paper considers the Optimum Communication Spanning Tree Problem. An integer...
The clustered prize-collecting arc routing problem
The clustered prize-collecting arc routing problem
2009
Prize-collecting arc routing problems are arc routing problems where, in addition to...
Heuristic and lower bound for a stochastic location–routing problem
Heuristic and lower bound for a stochastic location–routing problem
2007
In this article a stochastic location–routing problem is defined and cast as a...
Exact solutions to a class of stochastic generalized assignment problems
Exact solutions to a class of stochastic generalized assignment problems
2006
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only...
Privatized rural postman problems
Privatized rural postman problems
2006
In this work we analyze the privatized rural postman problem which is the edge version...
Hybrid scatter search and path relinking for the capacitated p-median problem
Hybrid scatter search and path relinking for the capacitated p-median problem
2006
In this paper we propose heuristic algorithms for the capacitated p -median problem....
Filtering policies in loss queuing network location problems
Filtering policies in loss queuing network location problems
2005
In this paper we deal with two stationary loss queuing network location models. We...
A compact model and tight bounds for a combined location–routing problem
A compact model and tight bounds for a combined location–routing problem
2005
This paper considers a combined location–routing problem. We define an auxiliary...
Multiobjective solution of the uncapacitated plant location problem
Multiobjective solution of the uncapacitated plant location problem
2003
In this paper we consider the discrete multiobjective uncapacitated plant location...
On the undirected rural postman problem: Tight bounds based on a new formulation
On the undirected rural postman problem: Tight bounds based on a new formulation
2003
The Rural Postman Problem (RPP) is a classic ‘edge-routing’ problem. A...
A Tabu search heuristic for the generalized assignment problem
A Tabu search heuristic for the generalized assignment problem
2001
This paper considers the generalized assignment problem (GAP). It is a well-known...
The stochastic generalised assignment problem with Bernoulli demands
The stochastic generalised assignment problem with Bernoulli demands
2000
This paper deals with the Stochastic Generalised Assignment problem. It presents...
Papers per page: