The Optimum Communication Spanning Tree Problem : properties, models and algorithms

Abstract

For a given cost matrix and a given communication requirement matrix, the OCSTP is defined as finding a spanning tree that minimizes the operational cost of the network. OCST can be used to design of more efficient communication and transportation networks, but appear also, as a subproblem, in hub location and sequence alignment problems. This thesis studies several mixed integer linear optimization formulations of the OCSTP and proposes a new one. Then, an efficient Branch & Cut algorithm derived from the Benders decomposition of one of such formulations is used to successfully solve medium-sized instances of the OCSTP. Additionally, two new combinatorial lower bounds, two new heuristic algorithms and a new family of spanning tree neighborhoods based on the Dandelion Code are presented and tested

Similar works

Full text

thumbnail-image

Tesis Doctorals en Xarxa

Provided a free PDF
oai:www.tdx.cat:10803/387546Last time updated on 2/27/2017View original full text link

This paper was published in Tesis Doctorals en Xarxa.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.