Ara es mostren els items 48-57 de 57

    • Scheduling policies for multi-period services 

      Núñez del Toro, Alma Cristina; Fernández Aréizaga, Elena; Kalcsics, Jörg; Nickel, Stefan (Elsevier, 2015-02-12)
      Article
      Accés obert
      This paper discusses a multi-period service scheduling problem. In this problem, a set of customers is given who periodically require service over a finite time horizon. To satisfy the service demands, a set of operators ...
    • Solutions to the facility location problem with general Bernoulli demands 

      Albareda Sambola, Maria; Fernández Aréizaga, Elena; Saldanha da Gama, Francisco (2015)
      Text en actes de congrés
      Accés obert
      In this work we address the facility location problem with general Bernoulli demands. Extended formulations are proposed for two different outsourcing policies, which allow using sample average approximation for estimating ...
    • Solving an Urban Waste Collection Problem Using Ants Heuristics 

      Bautista Valhondo, Joaquín; Fernández Aréizaga, Elena; Pereira Gude, Jordi (2006-07-28)
      Article
      Accés obert
      This paper describes the methodology that we have applied for the solution of an urban waste collection problem in the municipality of Sant Boi de Llobregat, within the metropolitan area of Barcelona (Spain). The basic ...
    • Solving the optimum communication spanning tree problem 

      Zetina, Carlos Armando; Contreras Aguilar, Iván; Fernández Aréizaga, Elena; Luna Mota, Carlos (Elsevier, 2019-02)
      Article
      Accés obert
      This paper presents an algorithm based on Benders decomposition to solve the optimum communication spanning tree problem. The algorithm integrates within a branch-and-cut framework a stronger reformulation of the problem, ...
    • The flexible periodic vehicle routing problem 

      Archetti, C; Fernández Aréizaga, Elena; Huerta Muñoz, Diana Lucia (2017-09)
      Article
      Accés obert
      This paper introduces the Flexible Periodic Vehicle Routing Problem (FPVRP) where a carrier has to establish a distribution plan to serve his customers over a planning horizon. Each customer has a total demand that must ...
    • The generalized arc routing problem 

      Aráoz Durand, Julián Arturo; Fernández Aréizaga, Elena; Franquesa, Carles (Springer, 2017-10)
      Article
      Accés obert
      This paper focuses on the generalized arc routing problem. This problem is stated on an undirected graph in which some clusters are defined as pairwise-disjoint connected subgraphs, and a route is sought that traverses at ...
    • The multi-period incremental service facility location problem 

      Albareda Sambola, Maria; Fernández Aréizaga, Elena; Hinojosa, Yolanda; Puerto Albandoz, Justo (2009)
      Article
      Accés restringit per política de l'editorial
      In this paper we introduce the multi-period incremental service facility location problem where the goal is to set a number of new facilities over a finite time horizon so as to cover dynamically the demand of a given set ...
    • The recoverable robust facility location problem 

      Alvarez Miranda, Eduardo; Fernández Aréizaga, Elena; Ljubic, Ivana (2015-09-01)
      Article
      Accés obert
      This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) ...
    • The shared customer collaboration vehicle routing problem 

      Fernández Aréizaga, Elena; Roca Riu, Mireia; Speranza, M. Grazia (Elsevier, 2018-03-16)
      Article
      Accés obert
      This paper introduces a new vehicle routing problem that arises in an urban area where several carriers operate and some of their customers have demand of service for more than one carrier. The problem, called Shared ...
    • The Windy clustered prize-collecting arc-routing problem 

      Corberan, Angel; Fernández Aréizaga, Elena; Franquesa Niubó, Carles; Sanchis, Jose Maria (2011-08)
      Article
      Accés restringit per acord de confidencialitat
      This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of ...