MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Parameter Shortest Path Algorithms with an Application to Cyclic Staffing

Author(s)
Karp, Richard M.; Orlin, James B., 1953-
Thumbnail
DownloadOR-103-80.pdf (859.8Kb)
Metadata
Show full item record
Abstract
Let G = (V,E) be a digraph with n vertices including a special vertex s. Let E' C E be a designated subset of edges. For each e E E there is an associated real number fl(e). Furthermore, let 1 if e E E' f2(e): 0 if e E-E' The length of edge e is flpe)-Af2(e), where X is a parameter that takes on real values. Thus the length varies additively in X for each edge of E'. We shall present two algorithms for computing the shortest path from s to each vertex v E V parametrically in the parameter X, with respective running times O(n3 ) and O(nlE llogn). For dense digraphs the running time of the former algorithm is comparable to the fastest (non-parametric) shortest path algorithm known. This work generalizes the results of Karp [2] concerning the minimum cycle mean of a digraph, which reduces to the case that E' = E. Furthermore, the second parametric algorithm may be used in conjunction with a transformation given by Bartholdi, Orlin, and Ratliff [1] to give an O(n21logn) algorithm for the cyclic staffing problem.
Date issued
1980-10
URI
http://hdl.handle.net/1721.1/5180
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 103-80

Collections
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.