Notes--On the Efficiency of a Direct Search Method to Locate Negative Cycles in a Network

Jin Y. Yen
Additional contact information
Jin Y. Yen: University of Santa Clara

Management Science, 1972, vol. 19, issue 3, 333-335

Abstract: The purpose of this note is to examine the efficiency of Direct Search Method (DSM) in terms of its computational upper bound. Comparisons of the efficiencies of DSM and other efficient algorithms (in terms of their computational upper bounds) are also presented.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.3.333 (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:ormnsc:v:19:y:1972:i:3:p:333-335

Access Statistics for this article

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