A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search
2010
Networks
We consider the generalized minimum edge-biconnected network problem where the nodes of a graph are partitioned into clusters and exactly one node from each cluster is required to be connected in an edge-biconnected way. Instances of this problem appear, for example, in the design of survivable backbone networks. We present different variants of a variable neighborhood search approach that utilize different types of neighborhood structures, each of them addressing particular properties as
doi:10.1002/net.20370
fatcat:tfavh74vz5hphmvpsnyy4nygxq