The relax codes for linear minimum cost network flow problems

Dimitri P. Bertsekas; Paul Tseng

doi:10.1007/BF02288322

The relax codes for linear minimum cost network flow problems

Dimitri P. Bertsekas, Paul Tseng

Research output: Contribution to journal › Article › peer-review

49 Scopus citations

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	https://doi.org/10.1007/BF02288322
State	Published - Dec 1988
Externally published	Yes

ASJC Scopus subject areas

General Decision Sciences
Management Science and Operations Research

Access to Document

10.1007/BF02288322

Cite this

@article{95fd1e82b1cb416db34d181cdce851ec,

title = "The relax codes for linear minimum cost network flow problems",

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.",

author = "Bertsekas, {Dimitri P.} and Paul Tseng",

year = "1988",

month = dec,

doi = "10.1007/BF02288322",

language = "English (US)",

volume = "13",

pages = "125--190",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - The relax codes for linear minimum cost network flow problems

AU - Bertsekas, Dimitri P.

AU - Tseng, Paul

PY - 1988/12

Y1 - 1988/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0042080258&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042080258&partnerID=8YFLogxK

U2 - 10.1007/BF02288322

DO - 10.1007/BF02288322

M3 - Article

AN - SCOPUS:0042080258

SN - 0254-5330

VL - 13

SP - 125

EP - 190

JO - Annals of Operations Research

JF - Annals of Operations Research

IS - 1

ER -

The relax codes for linear minimum cost network flow problems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this