Network design problems concern the selection of arcs in a graph in order to satisfy, at
minimum cost, some flow requirements, usually expressed in the form of origin–destination …

Network design models have wide applications in telecommunications and transportation
planning; see, for example, the survey articles by Magnanti and Wong (1984), Minoux …

For the past few decades, combinatorial optimization techniques have been shown to be
powerful tools for formulating and solving optimization problems arising from practical …

In this paper we study the cost-optimal deployment of optical access networks considering
variants of the problem such as fiber to the home (FTTH), fiber to the building (FTTB), fiber to …

The explosion of data traffic and the availability of enormous bandwidth via dense
wavelength division multiplexing (DWDM) and optical amplifier (OA) technologies make it …

Publisher Summary This chapter describes the optimization models that effectively address
the coordination of various decisions concerning the planning and design of the supply …

Consider a directed graph G=(V, A), and a set of traffic demands to be shipped between
pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer …

We study a capacity expansion problem that arises in telecommunication network design.
Given a capacitated network and a traffic demand matrix, the objective is to add capacity to …

We present a branch-and-cut algorithm to solve capacitated network design problems.
Given a capacitated network and point-to-point traffic demands, the objective is to install …

We describe an exact solution procedure, based on the use of standard LP software, for
multicommodity network optimization problems with general discontinuous step-increasing …