Separating tight metric inequalities by bilevel programming

We present the first exact approach to separate tight metric inequalities for the Network Loading problem. We give a bilevel programming formulation for the separation problem, develop an algorithm based on the proposed formulation and discuss computational results.