Advanced Search
MyIDEAS: Login

Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs

Contents:

Author Info

  • Ramaswamy, Ramkumar
  • Orlin, James B.
  • Chakravarty, Nilopal
Registered author(s):

    Abstract

    This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity path problem in an undirected network. For both problems, we determine the maximum and minimum weights that each edge can have so that a given path remains optimal. For both problems, we show how to determine these maximum and minimum values for all edges in O(m + K log K) time, where m is the number of edges in the network, and K is the number of edges on the given optimal path.

    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://hdl.handle.net/1721.1/5065
    Download Restriction: no

    Bibliographic Info

    Paper provided by Massachusetts Institute of Technology (MIT), Sloan School of Management in its series Working papers with number 4465-03.

    as in new window
    Length:
    Date of creation: 30 Apr 2004
    Date of revision:
    Handle: RePEc:mit:sloanp:5065

    Contact details of provider:
    Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA
    Phone: 617-253-2659
    Web page: http://mitsloan.mit.edu/
    More information through EDIRC

    Order Information:
    Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA

    Related research

    Keywords: sensitivity analysis; shortest path problem; bottleneck shortest path; maximum capacity path problem;

    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:mit:sloanp:5065. 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: (Christian Zimmermann).

    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.