In this paper we discuss the theoretical efficiency of the most commonly used methods for solving mimimum cost flow problems. These methods are referred to as "Path", "M-Path", "Cycle", "Primalâ€¦ (More)

Two examples are presented. The first example is "bad" for a large subset of the "primal" minimum cost flow algorithms, namely those algorithms which start with the required amount of s t flowâ€¦ (More)

AnSTnACT. This paper deals with the "f i rs t labelled first scanned" maximal flow algorithm proposed by Edmonds and Karp as described by Hu. I t is shown that flow problems using their method mayâ€¦ (More)

The idea of eliminating negative cost arcs by setting flows at upper bounds appears in Shapiro [3] and Johnson [2]. We show that their procedure is the same as that obtained by transforming to aâ€¦ (More)