112,154 research outputs found
Robust Design of Single-Commodity Networks
The results in the present work were obtained in a collaboration with Eduardo Álvarez-
Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi
and Tiziano Parriani.
The subject of this thesis is a robust network design problem, i.e., a problem of the type
“dimension a network such that it has sufficient capacity in all likely scenarios.” In our case,
we model the network with an undirected graph in which each scenario defines a supply or
demand for each node. We say that a flow in the network is feasible for a scenario if it can
balance out its supplies and demands. A scenario polytope B defines which scenarios are
relevant. The task is now to find integer capacities that minimize the total installation costs
while allowing for a feasible flow in each scenario. This problem is called Single-Commodity
Robust Network Design Problem (sRND) and was introduced by Buchheim, Liers and Sanità
(INOC 2011). The problem contains the Steiner Tree Problem (given an undirected graph
and a terminal set, find a minimum cost subtree that connects all terminals) and therefore
is N P-hard. The problem is also a natural extension of minimum cost flows.
The network design literature treats the case that the scenario polytope B is given as
the finite set of its extreme points (finite case) and that it is given as the feasible region
of finitely many linear inequalities (polyhedral case). Both descriptions are equivalent,
however, an efficient transformation is not possible in general.
Buchheim, Liers and Sanità (INOC 2011) propose a Branch-and-Cut algorithm for the
finite case. In this case, there exists a canonical problem formulation as a mixed integer
linear program (MIP). It contains a set of flow variables for every scenario. Buchheim, Liers
and Sanità enhance the formulation with general cutting planes that are called target cuts.
The first part of the dissertation considers the problem variant where every scenario has
exactly two terminal nodes. If the underlying network is a complete, unweighted graph,
then this problem is the Network Synthesis Problem as defined by Chien (IBM Journal of
R&D 1960). There exist polynomial time algorithms by Gomory and Hu (SIAM J. of Appl.
Math 1961) and by Kabadi, Yan, Du and Nair (SIAM J. on Discr. Math.) for this special
case. However, these algorithms are based on the fact that complete graphs are Hamiltonian.
The result of this part is a similar algorithm for hypercube graphs that assumes a special
distribution of the supplies and demands. These graphs are also Hamiltonian.
The second part of the thesis discusses the structure of the polyhedron of feasible sRND
solutions. Here, the first result is a new MIP-based capacity formulation for the sRND
problem. The size of this formulation is independent of the number of extreme points
of B and therefore, it is also suited for the polyhedral case. The formulation uses so-called
cut-set inequalities that are known in similar form from other network design problems. By
adapting a proof by Mattia (Computational Optimization and Applications 2013), we show
that cut-set inequalities induce facets of the sRND polyhedron. To obtain a better linear
programming relaxation of the capacity formulation, we interpret certain general mixed
integer cuts as 3-partition inequalities and show that these inequalities induce facets as well.
The capacity formulation has exponential size and we therefore need a separation algorithm
for cut-set inequalities. In the finite case, we reduce the cut-set separation problem to
a minimum cut problem that can be solved in polynomial time. In the polyhedral case,
however, the separation problem is N P-hard, even if we assume that the scenario polytope
is basically a cube. Such a scenario polytope is called Hose polytope. Nonetheless, we can
solve the separation problem in practice: We show a MIP based separation procedure for
the Hose scenario polytope. Additionally, the thesis presents two separation methods for
3-partition inequalities. These methods are independent of the encoding of the scenario
polytope. Additionally, we present several rounding heuristics.
The result is a Branch-and-Cut algorithm for the capacity formulation. We analyze the
algorithm in the last part of the thesis. There, we show experimentally that the algorithm
works in practice, both in the finite and in the polyhedral case. As a reference point, we
use a CPLEX implementation of the flow based formulation and the computational results by
Buchheim, Liers and Sanità. Our experiments show that the new Branch-and-Cut algorithm
is an improvement over the existing approach. Here, the algorithm excels on problem
instances with many scenarios. In particular, we can show that the MIP separation of the
cut-set inequalities is practical
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
Motivated by the observation that FIFO-based push-relabel algorithms are able
to outperform highest label-based variants on modern, large maximum flow
problem instances, we introduce an efficient implementation of the algorithm
that uses coarse-grained parallelism to avoid the problems of existing parallel
approaches. We demonstrate good relative and absolute speedups of our algorithm
on a set of large graph instances taken from real-world applications. On a
modern 40-core machine, our parallel implementation outperforms existing
sequential implementations by up to a factor of 12 and other parallel
implementations by factors of up to 3
- …