E. Fernández, C. Luna-Mota
Decomposition methods have proven successful in many Network Design problems. Many improvements over the classic Benders decomposition algorithm can be implemented for the particular case of the Optimum Communication Spanning Tree Problem, whose aim is to find the spanning tree that minimizes the operational cost of the network. In our research we exploit the structural qualities of spanning trees to design a competitive Branch & Cut algorithm for the OCSTP.
Keywords: Optimum Communication Spanning Tree, Benders Decomposition, Network DesignScheduled
F1 Routing 1
October 2, 2015 9:00 AM
Salón de actos