New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures

Fred Glover and Darwin Klingman
Additional contact information
Fred Glover: University of Colorado, Boulder, Colorado
Darwin Klingman: The University of Texas at Austin, Austin, Texas

Operations Research, 1989, vol. 37, issue 4, 542-546

Abstract: Building on the framework of partitioning shortest path (PSP) algorithms, we introduce two new methods that exhibit different types of sharpness properties, based on a refinement of the sharpness concept of Shier and Witzgall. We show that the first of these two methods, which we classify as globally sharp , has a complexity bound that is superior to the complexity bound for the previous PSP algorithm, THRESH-S, that exhibits the same sharpness properties. The second new method, which we classify as globally scan-sharp , has a better bound and exhibits sharpness properties that are nearly as comprehensive. Finally, we discuss methods for identifying negative cycles that possess a time-sharpness property.

Keywords: networks/graphs:; distance; algorithms (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.4.542 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:4:p:542-546

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().