Now showing items 1-5 of 5

    • Exact solution of hub network design problems with profits 

      Alibeyg, Armaghan; Contreras Aguilar, Iván; Fernández Aréizaga, Elena (Elsevier, 2018-04-01)
      Article
      Open Access
      This paper studies hub network design problems with profits. They consider a profit-oriented objective that measure the tradeoff between the revenue due to served commodities and the overall network design and transportation ...
    • 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
      Restricted access - publisher's policy
      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 ...
    • Hub network design problems with profits 

      Alibeyg, Armaghan; Contreras Aguilar, Iván; Fernández Aréizaga, Elena (2016-12-01)
      Article
      Open Access
      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 ...
    • 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
      Restricted access - publisher's policy
      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 ...
    • 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
      Open Access
      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, ...