Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …

Multilayer network design represents an important problem class when interwoven design
decisions must be simultaneously considered. Examples of such cases are the selection of …

This survey presents cutting planes that are useful or potentially useful in solving mixed
integer programs. Valid inequalities for (i) general integer programs,(ii) problems with local …

Benders decomposition has been widely used for solving network design problems. In this
paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et …

A frame relay service offers virtual private networks to customers by provisioning a set of
long‐term private virtual circuits (PVCs) between customer endpoints on a large backbone …

This article focuses on the problem of interdicting layered networks that involve a physical
flow network and an information flow network. There exist dependencies between these …

We estimate potential energy savings in IP-over-WDM networks achieved by switching off
router line cards in low-demand hours. We compare three approaches to react on dynamics …

We address the problem of designing a network built on several layers. This problem occurs
in practical applications but has not been studied extensively from the point of view of global …

This paper deals with MIP-based primal heuristics to be used within a branch-and-cut
approach for solving multi-layer telecommunication network design problems. Based on a …

The possibility of adding multi protocol label switching (MPLS) support to transport networks
is considered an important opportunity by telecom carriers that want to add packet services …