Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Review
2007
Review
2007
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with… 
Highly Cited
2003
Highly Cited
2003
1999
1999
We present an O(nm)-time network simplex algorithm for finding a tree of shortest paths from a given node to all other nodes in a… 
Highly Cited
1997
Highly Cited
1997
  • R. Tarjan
  • Mathematical programming
  • 1997
  • Corpus ID: 18977577
Thedynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges… 
Highly Cited
1996
Highly Cited
1996
  • J. Orlin
  • ACM-SIAM Symposium on Discrete Algorithms
  • 1996
  • Corpus ID: 3107792
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open… 
1992
1992
In this paper, we present a new primal simplex pivot rule and analyze the worst case complexity of the resulting simplex… 
Highly Cited
1989
Highly Cited
1989
Given a network having costs and upper bound constraints on the flows in its arcs, the minimum-cost network flow problem is that… 
Highly Cited
1979
Highly Cited
1979
  • W. Cunningham
  • Mathematics of Operations Research
  • 1979
  • Corpus ID: 10938203
An example of cycling in the network simplex method is given and some restrictions on its occurrence are proved. An example of…