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

We consider the problem of designing the logistic system to assure adequate distribution of
relief aid in a post-natural-disaster situation, when damages to infrastructure may disrupt the …

Given a graph with nonnegative edge weights and node pairs Q, we study the problem of
constructing a minimum weight set of edges so that the induced subgraph contains at least K …

The development of new mathematical theory and its application in software systems for the
solution of hard optimization problems have a long tradition in mathematical programming …

During the past 50 years telecommunication network technology has raced ahead powered
by exponential advances in computer chip and fiber optic technology. The introduction of …

This thesis focuses on two NP-hard network design problems: the first one, vertex
biconnectivity augmentation (V2AUG), appears in the design of survivable communication or …

We study a new network design model combining ring and tree structures under capacity
constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on …

We consider the network design problem which consists in determining at minimum cost a 2-
edge connected network such that the shortest cycle (a “ring”) to which each edge belongs …

We study the polyhedron associated with a network design problem which consists in
determining at minimum cost a two-connected network such that the shortest cycle to which …

We study the problem of designing at minimum cost a two-connected network such that each
edge belongs to a cycle using at most K edges. This problem is a particular case of the two …