The relax codes for linear minimum cost network flow problems

Research output: Contribution to journalArticlepeer-review

49 Scopus citations


We describe a relaxation algorithm [1,2] for solving the classical minimum cost network flow problem. Our implementation is compared with mature state-of-the-art primal simplex and primal-dual codes and is found to be several times faster on all types of randomly generated network flow problems. Furthermore, the speed-up factor increases with problem dimension. The codes, called RELAX-II and RELAXT-II, have a facility for efficient reoptimization and sensitivity analysis, and are in the public domain.

Original languageEnglish (US)
Pages (from-to)125-190
Number of pages66
JournalAnnals of Operations Research
Issue number1
StatePublished - Dec 1988
Externally publishedYes

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research


Dive into the research topics of 'The relax codes for linear minimum cost network flow problems'. Together they form a unique fingerprint.

Cite this