## Seminar - Sara Mattia: March 1 2011, 11:00

**When**: March 1, 2011, at 11:00 **Where**: Aula A4 **Speaker**: Sara Mattia, Technische Universität Dortmund, Fakultät für Mathematik.**Title**: Separating Tight Metric Inequalities by Bilevel Programming **Abstract**:

Given a graph with capacity installation costs for the edges and a set of point-to-point traffic demands, or commodities, the Network Loading problem consists of choosing minimum cost integer capacities such that all the commodities can be routed simultaneously on the network. The tight metric inequalities are the inequalities which completely characterize the convex-hull of integer feasible solutions of the capacity formulation of the problem. In this talk the first approach for separating tight metric inequalities is presented. A bilevel programming formulation for the separation problem is given and a corresponding separation algorithm is developed. Computational results are discussed.

**Duration:** ~45 min.