Publisher Summary This chapter focuses on the important practical and theoretical problem
of designing survivable communication networks, ie, communication networks that are still …

Historically, there is a close connection between geometry and optImization. This is
illustrated by methods like the gradient method and the simplex method, which are …

We study the problem of interdicting the arcs in a network in order to maximize the shortest s–
t path length.“Interdiction” is an attack on an arc that destroys the arc or increases its …

Telecommunications has had a major impact in all aspects of life in the last century. There is
little doubt that the transformation from the industrial age to the information age has been …

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

A spanning tree in a graph is the smallest connected spanning subgraph. Given a graph,
how does one find the smallest (ie, least number of edges) 2-connected spanning subgraph …

This paper studies a topical and economically significant capacitated network design
problem that arises in the telecommunications industry. In this problem, given point-to-point …

This paper is about modeling and solving mixed integer programming (MIP) problems. In the
last decade, the use of mixed integer programming models has increased dramatically …

The study and solution of mixed-integer programming problems is of great interest, because
they arise in a variety of mathematical and practical applications. Today's state-of-art …

The paper presents a survey of methods and approaches solving linear integer problems,
developed during the last 50 years. These problems belong to the class of NP-hard …