Now showing items 1-2 of 2

  • Lagrangean bounds for the optimum communication spanning tree problem 

    Contreras, I.; Fernández Aréizaga, Elena; Marín, Alfredo (Springer Verlag, 2010)
    Article
    Restricted access - publisher's policy
    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 ...
  • When centers can fail: a close second opportunity 

    Albareda Sambola, Maria; Hinojosa, Yolanda; Marín, Alfredo; Puerto Albandoz, Justo (2015-10-01)
    Article
    Restricted access - publisher's policy
    This paper presents the p-next center problem, which aims to locate p out of n centers so as to minimize the maximum cost of allocating customers to backup centers. In this problem it is assumed that centers can fail and ...