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

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

Show other versions (1)

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...

Full description

Bibliographic Details
Main Authors: Ramaswamy, Ramkumar, Orlin, James, Chakravarty, Nilopal
Format: Working Paper
Language:en_US
Published: 2004
Subjects:
sensitivity analysis
shortest path problem
bottleneck shortest path
maximum capacity path problem
Online Access:http://hdl.handle.net/1721.1/7389

Similar Items

Similar Items