EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"bottleneck shortest path"
Narrow search

Narrow search

Year of publication
Subject
All
bottleneck shortest path 2 maximum capacity path problem 2 sensitivity analysis 2 shortest path problem 2
Online availability
All
Free 2
Type of publication
All
Book / Working Paper 2
Language
All
Undetermined 2
Author
All
Chakravarty, Nilopal 2 Ramaswamy, Ramkumar 2 Orlin, James 1 Orlin, James B. 1
Institution
All
Sloan School of Management, Massachusetts Institute of Technology (MIT) 2
Published in...
All
Working papers / Sloan School of Management, Massachusetts Institute of Technology (MIT) 2
Source
All
RePEc 2
Showing 1 - 2 of 2
Cover Image
Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
Ramaswamy, Ramkumar; Orlin, James B.; Chakravarty, Nilopal - Sloan School of Management, Massachusetts Institute of … - 2004
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...
Persistent link: https://www.econbiz.de/10005749139
Saved in:
Cover Image
Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
Ramaswamy, Ramkumar; Orlin, James; Chakravarty, Nilopal - Sloan School of Management, Massachusetts Institute of … - 2004
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...
Persistent link: https://www.econbiz.de/10005750538
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...