Work

Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems

Year: 2011
Type: report
Abstract: In this paper, we present a new primal simplex pivot rule and analyse the worst-case complexity of the resulting simplex algorithm for the minium cost flow problem, the assignment problem and the shortest path problem.We consider networks with n nodes, m arcs, integral arc capacities bounded by an integer number U, and integral arc costs bounded by an integer number C. Let L and U denote the nonbasic arcs at their lower and upper bounds respectively, and cij denote the reduced cost of any arc (i, j).Further, let A be a parameter whose initial value is C. Then our pivot rule is as follows: Select as an entering arc any (i, j) L with cij < -A/2 or any (i, j) U with cij A/2; select the leaving arc so that the strong feasibility of the basis is maintained.When there is no nonbasic arc satisfying this rule then replace A by A/2.We show that the simplex algorithm using this rule performs O(nm U logC) pivots and can be implemented to run in O(m 2 U logC) time.Specializing these results for the assignment and shortest path problems we show that the simplex algorithm solves these problems in O(n 2 logC) pivots and O(nm logC) time.These algorithms use the same data structures that are typically used to implement the primal simplex algorithms for network problems and have enough flexibility for fine tuning the algorithms in practice.We also use these ideas to obtain an O(nm logC) label correcting algorithm for the shortest path problem with arbitrary arc lengths, and an improved implementation of Dantzig's pivot rule.
Language: English
Open Access status: green
OpenAlex ID: W2285732947
Cites: 20
Cited by: 6
Related to: 10