Abstract
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 language | English (US) |
|---|---|
| Pages (from-to) | 125-190 |
| Number of pages | 66 |
| Journal | Annals of Operations Research |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 1988 |
| Externally published | Yes |
ASJC Scopus subject areas
- Decision Sciences(all)
- Management Science and Operations Research