A Direct Search Method to Locate Negative Cycles in a Graph

M. Florian and P. Robert
Additional contact information
M. Florian: Dèpartement d'Informatique, Université de Montreal
P. Robert: Dèpartement d'Informatique, Université de Montreal

Management Science, 1971, vol. 17, issue 5, 307-310

Abstract: A direct search method for locating and tracing negative cycles in a graph is developed based on a property of real, finite sequences. The efficiency of the method and its application for computing minimum cost flows is tested by applying it to solve a series of assignment problems.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.5.307 (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:17:y:1971:i:5:p:307-310

Access Statistics for this article

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