Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

9 relations
Assignment problemGraph theoryMathematical optimizationMinimum-cost flow problem
Expand

Broader (3)

Linear programmingNetwork theoryOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Improving the modulo simplex algorithm for large-scale periodic timetabling
The periodic event scheduling problem (PESP), in which events have to be scheduled repeatedly over a given period, is a complex… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Review
2007
Review
2007
Combinatorial Optimization: Theory and Algorithms
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with… 
  • table 1.1
  • table 1.2
  • figure 2.1
  • figure 2.2
  • figure 2.3
1999
1999
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
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
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
  • R. Tarjan
  • Math. Program.
  • 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
A polynomial time primal network simplex algorithm for minimum cost flows
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
1996
1996
Solving Large-Scale Real-World Minimum-Cost Flow Problems by a Network Simplex Method
This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new… 
1992
1992
The Scaling Network Simplex Algorithm
In this paper, we present a new primal simplex pivot rule and analyze the worst case complexity of the resulting simplex… 
1991
1991
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
  • R. Tarjan
  • Math. Oper. Res.
  • 1991
  • Corpus ID: 29978686
We study the number of pivots required by the primal network simplex algorithm to solve the minimum-cost circulation problem. We… 
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1989
Highly Cited
1989
A continuous-time network simplex algorithm
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
Theoretical Properties of the Network Simplex Method
An example of cycling in the network simplex method is given and some restrictions on its occurrence are proved. An example of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE