Ramaswamy, Ramkumar Orlin, James Chakravarty, Nilopal
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
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by Massachusetts Institute of Technology (MIT), Sloan School of Management in its series Working papers with number
4465-03.
Length: Date of creation: 10 Dec 2004 Date of revision: Handle: RePEc:mit:sloanp:7389
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
For technical questions regarding this item, or to correct its listing, contact: (Christian Zimmermann).