The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm

Refael Hassin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

This paper is concerned with the minimum cost flow problem. It is shown that the class of dual algorithms which solve this problem consists of different variants of a common general algorithm. We develop a new variant which is, in fact, a new form of the 'primal-dual algorithm' and which has several interesting properties. It uses, explicitly only dual variables. The slope of the change in the (dual) objective is monotone. The bound on the maximum number of iterations to solve a problem with integral bounds on the flow is better than bounds for other algorithms.

Original languageEnglish
Pages (from-to)228-239
Number of pages12
JournalMathematical Programming
Volume25
Issue number2
DOIs
StatePublished - Jun 1983

Keywords

  • Minimum Cost Network Flow
  • Primal-Dual Algorithm
  • Tree-Search Algorith

Fingerprint

Dive into the research topics of 'The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm'. Together they form a unique fingerprint.

Cite this