Network simplex algorithm

Known as: Network simplex method 
In mathematical optimization, the network simplex algorithm is a graph theoretic specialization of the simplex algorithm. The algorithm is usually… (More)
Wikipedia

Related topics

Related topics

9 relations
Assignment problemGraph theoryMathematical optimizationMinimum-cost flow problem
(More)

Broader (3)

Linear programmingNetwork theoryOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
A Hypergraph Network Simplex Algorithm
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
Network Simplex Algorithm for DAG Layering
This article is committed to the problem of partitioning a directed acyclic graph into layers such that all edges to the same… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
2003
2003
Network simplex algorithm for the general equal flow problem
In this paper the general equal flow problem is considered. This is a minimum cost network flow problem with additional side… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
A network simplex algorithm with O(n) consecutive degenerate pivots
In this paper, we suggest a new pivot rule for the primal simplex algorithm for the minimum cost flow problem, known as the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1997
1997
A new strongly polynomial dual network simplex algorithm
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
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
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
A new pivot selection rule for the network simplex algorithm
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
A Faster Primal Network Simplex Algorithm
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
A polynomial time primal network simplex algorithm for minimum cost flows
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
A network simplex method
Simple combinatorial modifications are given which ensure finiteness in the primal simplex method for the transshipment problem… (More)
  • figure 1
Is this relevant?