# Network simplex algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Review

2017

Review

2017

- OR
- 2017

We describe a network simplex algorithm for the minimum cost flow problem on graph-based hypergraphs which are directedâ€¦Â (More)

Is this relevant?

2013

2013

- International Conference on Computational andâ€¦
- 2013

This article is committed to the problem of partitioning a directed acyclic graph into layers such that all edges to the sameâ€¦Â (More)

Is this relevant?

2003

2003

- European Journal of Operational Research
- 2003

In this paper the general equal flow problem is considered. This is a minimum cost network flow problem with additional sideâ€¦Â (More)

Is this relevant?

2002

2002

- Oper. Res. Lett.
- 2002

In this paper, we suggest a new pivot rule for the primal simplex algorithm for the minimum cost flow problem, known as theâ€¦Â (More)

Is this relevant?

1997

1997

- Math. Program.
- 1997

This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directlyâ€¦Â (More)

Is this relevant?

1997

1997

- Math. Program.
- 1997

The dynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edgesâ€¦Â (More)

Is this relevant?

1997

1997

- Math. Program.
- 1997

We present a new network simplex pivot selection rule, which we call the minimum ratio pivot rule, and analyze the worst-caseâ€¦Â (More)

Is this relevant?

1996

1996

- 1996

We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nmâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Math. Program.
- 1996

Developing a polynomial time algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, weâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- Math. Program.
- 1976

Simple combinatorial modifications are given which ensure finiteness in the primal simplex method for the transshipment problemâ€¦Â (More)

Is this relevant?