Ara es mostren els items 1-20 de 31

  • A biased random-key genetic algorithm for the capacitated minimum spanning tree problem 

    Ruiz Ruiz, Hector Efrain; Albareda Sambola, Maria; Fernández Aréizaga, Elena; Resende, Mauricio G. C. (2015-05)
    Article
    Accés restringit per política de l'editorial
    This paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals,the ...
  • A flow formulation for the optimum communication spanning tree 

    Fernández Aréizaga, Elena; Luna Mota, Carlos; Hildenbrandt, Achim; Reinelt, Gerard; Wiesberg, Stefan (Universidad de La Laguna, 2013)
    Text en actes de congrés
    Accés obert
    In this paper we address the Optimum Communication Spanning Tree Problem. We present a formulation that uses three index variables and we propose several families of inequalities, which can be used to reinforce the ...
  • An evaluation of urban consolidation centers through continuous analysis with non-equal market share companies 

    Roca Riu, Mireia; Estrada Romeu, Miguel Ángel; Fernández Aréizaga, Elena (2015)
    Text en actes de congrés
    Accés obert
    This paper analyzes the logistic cost savings caused by the implementation of Urban Consolidation Centers (UCC) in a dense area of a city. In these urban terminals, freight flows from interurban carriers are consolidated ...
  • A novel model for arc territory design: promoting Eulerian districts 

    Garcia Ayala, Gariela; González Velarde, José Luis; Rios Mercados, Roger; Fernández Aréizaga, Elena (2015-01-01)
    Article
    Accés obert
    The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be ...
  • Diseño de rutas de recogida de residuos sólidos urbanos en el área metropolitana de Barcelona 

    Bautista Valhondo, Joaquín; Pereira Gude, Jordi; Fernández Aréizaga, Elena (Universidad de La Laguna. Servicio de Publicaciones, 2006)
    Text en actes de congrés
    Accés obert
    Los problemas aso ciados a la recogida de residuos sólidos urbanos son muy variados. En este traba jo se presenta el problema de diseño de itinerarios de recogida y se muestran los resultados ofrecidos p or un pro cedimiento ...
  • Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty 

    Albareda Sambola, Maria; Alonso Ayuso, Antonio; Escudero Bueno, Laureano; Fernández Aréizaga, Elena; Pizarro Romero, Celeste (2013-12)
    Article
    Accés restringit per política de l'editorial
    A multi-period discrete facility location problem is introduced for a risk neutral strategy with uncertainty in the costs and some of the requirements along the planning horizon. A compact 0–1 formulation for the Deterministic ...
  • Fixed-charge facility location problems in location science 

    Fernández Aréizaga, Elena; Landete, Mercedes (Springer, 2015-01-21)
    Capítol de llibre
    Accés restringit per política de l'editorial
    Fixed-Charge Facility Location Problems are among core problems in Location Science. There is a finite set of users with demand of service and a finite set of potential locations for the facilities that will offer service ...
  • General network design : a unified view of combined location and network design problems 

    Contreras Aguilar, Iván; Fernández Aréizaga, Elena (Elsevier, 2011-06-16)
    Article
    Accés restringit per política de l'editorial
    This paper presents a unified framework for the general network design problem which encompasses several classical problems involving combined location and network design decisions. In some of these problems the service ...
  • GEVA: geometric variability-based approaches for identifying patterns in data 

    Irigoien, I.; Arenas, Concepción; Fernández Aréizaga, Elena; Mestres, Francisco (2009-10-15)
    Article
    Accés restringit per política de l'editorial
    This paper, arising from population studies, develops clustering algorithms for identifying patterns in data. Based on the concept of geometric variability, we have developed one polythetic-divisive and three agglomerative ...
  • Heurísticas, planos secantes y optimización subgradiente para set partitioning 

    Barceló Bugeda, Jaime; Fernández Aréizaga, Elena (Universitat Politècnica de Barcelona. Centre de Càlcul, 1988)
    Article
    Accés obert
    En este artículo se estudian los problemas de Set Partitioning (SP) desde una perspectiva algorítmica. El diseño de un procedimiento heurístico permite no sólo disponer de soluciones posibles para los mismos, sino también ...
  • Heuristic solucions to the facility location problem with general Bernoulli demands 

    Albareda Sambola, Maria; Fernández Aréizaga, Elena; Saldanha da Gama, Francisco (2017-09-28)
    Article
    Accés obert
    In this paper, a heuristic procedure is proposed for the facility location problem with general Bernoulli demands. This is a discrete facility location problem with stochastic demands that can be formulated as a two-stage ...
  • Hiperheurística para un problema de equilibrado de líneas de montaje usando Scatter Search 

    Bautista Valhondo, Joaquín; Fernández Aréizaga, Elena; González, JL; Laguna, Manuel (2005)
    Text en actes de congrés
    Accés obert
    El presente trabajo se centra en la aplicación de un procedimiento basado en Scatter Search (SS) para resolver un problema de equilibrado de líneas de montaje. Tras una intr oducción a los denominados Assembly Line ...
  • Hub network design problems with profits 

    Alibeyg, Armaghan; Contreras Aguilar, Ivan; Fernández Aréizaga, Elena (2016-12-01)
    Article
    Accés restringit per política de l'editorial
    This paper presents a class of hub network design problems with profit-oriented objectives, which extend several families of classical hub location problems. Potential applications arise in the design of air and ground ...
  • Lagrangean bounds for the optimum communication spanning tree problem 

    Contreras, I.; Fernández Aréizaga, Elena; Marín, Alfredo (Springer Verlag, 2010)
    Article
    Accés restringit per política de l'editorial
    This paper considers the Optimum Communication Spanning Tree Problem. An integer programming formulation that yields tight LP bounds is proposed. Given that the computational effort required to obtain the LP bounds ...
  • Lagrangean Duals and Exact Solution to the Capacitated p-Center Problem 

    Albareda Sambola, Maria; Díaz, Juan A.; Fernández Aréizaga, Elena (2006-06-12)
    Article
    Accés obert
    In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we propose two different Lagrangean duals based ...
  • Minimizing the maximum travel time in a combined model of facility location and network design 

    Contreras Aguilar, Iván; Fernández Aréizaga, Elena; Reineltc, Gerhard (2012-12)
    Article
    Accés restringit per política de l'editorial
    This paper presents a combined Facility Location/Network Design Problem which simultaneously considers the location of facilities and the design of its underlying network so as to minimize the maximum customer-facility ...
  • Minimum Spanning Trees with neighborhoods: mathematical programming formulations and solution methods 

    Blanco, Víctor; Fernández Aréizaga, Elena; Puerto Albandoz, Justo (Elsevier, 2017-11-01)
    Article
    Accés restringit per política de l'editorial
    This paper studies Minimum Spanning Trees under incomplete information assuming that it is only known that vertices belong to some neighborhoods that are second order cone representable and distances are measured with a ...
  • Multi-depot rural postman problems 

    Fernández Aréizaga, Elena; Rodríguez Pereira, Jessica (Springer, 2017-07-01)
    Article
    Accés restringit per política de l'editorial
    This paper studies multi-depot rural postman problems on an undirected graph. These problems extend the well-known undirected rural postman problem to the case where there are several depots instead of just one. Linear ...
  • Multiperiod location-routing with decoupled time scales 

    Albareda Sambola, Maria; Fernández Aréizaga, Elena; Nickel, Stefan (Elsevier, 2012-03-01)
    Article
    Accés restringit per política de l'editorial
    This paper focuses on a multiperiod discrete facility location problem where transportation costs are considered together with location costs to design the operating facility pattern along a time horizon. The problem ...
  • On the collaboration uncapacitated arc routing problem 

    Fernández Aréizaga, Elena; Fontana, Dario; Speranza, M. Grazia (2016-03-01)
    Article
    Accés restringit per política de l'editorial
    This paper introduces a new arc routing problem for the optimization of a collaboration scheme among carriers. This yields to the study of a profitable uncapacitated arc routing problem with multiple depots, where carriers ...