| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142963 | Operations Research Letters | 2012 | 5 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sara Mattia,