Advanced Search
MyIDEAS: Login to save this paper or follow this series

The Robust Network Loading Problem with Dynamic Routing

Contents:

Author Info

  • Sara Mattia

    ()
    (Dipartimento di Informatica e Sistemistica "Antonio Ruberti" Sapienza, Universita' di Roma)

Registered author(s):

    Abstract

    The Robust Network Loading Problem (RNL) can be stated as follows. Given a graph and a set of traffic matrices, install minimum cost integer capacities on the edges such that all the matrices can be routed non simultaneously on the network. The routing scheme is said to be dynamic if we can choose a (possibly) different routing for every matrix, it is called static if the routing must be the same for all the matrices. The flows are unsplittable if each point-to-point demand (commodity) must use a single path, they are splittable if the flow for every commodity can be splitted along several paths. In this paper we present the first exact approach for solving the RNL problem with splittable flows and dynamic routing under polyhedral uncertainty for the demands. A branch-and-cut algorithm based on the capacity formulation of the problem defined by metric inequalities is developed, and polyhedral results are given. The separation problem is formulated as a bilevel programming problem and a corresponding single level problem is derived. Computational results are presented.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.dis.uniroma1.it/~bibdis/RePEc/aeg/wpaper/2010-03.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza" in its series DIS Technical Reports with number 2010-03.

    as in new window
    Length:
    Date of creation: Mar 2010
    Date of revision:
    Handle: RePEc:aeg:wpaper:2010-3

    Contact details of provider:
    Phone: +390677274140
    Fax: +39 0677274129
    Email:
    Web page: http://www.dis.uniroma1.it
    More information through EDIRC

    Related research

    Keywords: network design; robustness; branch-and-cut;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:aeg:wpaper:2010-3. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antonietta Angelica Zucconi).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.