title: Finding minimum-cost circulations by canceling negative cycles
body: <p>I'd like to solve the min-cost flow problem for graphs by cancelling negative cycles. Goldberg and Tarjan published a paper with this title in 1989 but I am unable to track down either a copy of the original or any more recent derived works that might explain the same algorithm.</p>
  
  <p>Does anyone have a document that describes this algorithm or any code that implements it?</p>