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.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.