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 …

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 capacitated covering IP is an integer program of the form min {l_brace} ex {vert_bar} Ux
{ge} d, 0 {le} x {le} b, x {element_of} Z {sup+}{r_brace}, where all entries of c, U, and d are …

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 …

Due to the success of the Internet and the diversity of communication applications, it is
becoming increasingly difficult to forecast traffic patterns. To capture the traffic variations, we …

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 …

Over the last decades, network design problems (NDPs) have been one of the most
investigated combinatorial optimisation problems that are still catching the interest of both …

This paper provides an analysis of capacitated network design cut–set polyhedra. We give a
complete linear description of the cut–set polyhedron of the single commodity–single facility …

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three
major scientific domains: mathematics, theoretical computer science and management. The …