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 Design


F1 Routing 1
October 2, 2015  9:00 AM
Salón de actos

Other papers in the same session

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.