Separating tight metric inequalities by bilevel programming

Separating tight metric inequalities by bilevel programming

0.00 Avg rating0 Votes
Article ID: iaor20127764
Volume: 40
Issue: 6
Start Page Number: 568
End Page Number: 572
Publication Date: Nov 2012
Journal: Operations Research Letters
Authors:
Keywords: combinatorial optimization
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.

Reviews

Required fields are marked *. Your email address will not be published.