World Scientific
  • Search
  •   
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

Robust Metric Inequalities for Network Loading Under Demand Uncertainty

    https://doi.org/10.1142/S0217595915500384Cited by:6 (Source: Crossref)

    In this paper, we consider the network loading problem under demand uncertainties with static routing, i.e., a single routing scheme based on the fraction of the demands has to be determined. We generalize the class of metric inequalities to the Γ-robust setting and show that they yield a formulation in the capacity space. We describe a polynomial time exact algorithm to separate violated robust metric inequalities as model constraints. Moreover, rounded and tight robust metric inequalities describing the convex hull of integer solutions are presented and separated in a cut-and-branch approach. Computational results using real-life telecommunication data demonstrate the potential of (tight) robust metric inequalities by considering the integrality gaps at the root node and the overall optimality gaps. Average speed-up factors between 2 and 5 for the compact flow and between 3 and 25 for the capacity formulation in the case of mid-sized instances have been achieved by exploiting robust metric inequalities in the solving process.

    References

    Remember to check out the Most Cited Articles!

    Be inspired by these New Titles in Business & Management today.
    With a wide range of areas, you're bound to find something you like.