Publication Date:
2012
abstract:
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.
Iris type:
01.01 Articolo in rivista
Keywords:
network design; tight metric inequalities; capacity formulation
List of contributors:
Mattia, Sara
Published in: