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)

Related topics

Related topics

9 relations
Assignment problemGraph theoryMathematical optimizationMinimum-cost flow problem

Broader (3)

Linear programmingNetwork theoryOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Power and resource aware scheduling with multiple voltages
In this paper, we address the problem of timing-constrained scheduling with resources operating at multiple voltages. Without the… 
2009
2009
An Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no… 
2009
2009
A network simplex algorithm for solving the minimum distribution cost problem
To model the distillation or decomposition of products in some manufacturing processes, a minimum distribution cost problem (MDCP… 
2005
2005
Quadratic cost flow and the conjugate gradient method
2003
2003
Bottleneck analysis for network flow model
1997
1997
A new pivot selection rule for the network simplex algorithm
We present a new network simplex pivot selection rule, which we call theminimum ratio pivot rule, and analyze the worst-case… 
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… 
1990
1990
Anti-stalling pivot rules for the network simplex algorithm
Stalling in the simplex algorithm is defined as an exponentially long sequence of consecutive degenerate pivots without cycling… 
Highly Cited
1986
Highly Cited
1986
An efficient implementation of the network simplex method
This paper describes an efficient implementation of the network simplex method for solving large sparse minimum-cost network flow… 
1984
1984
A submodular network simplex method
We present a simplex method for the solution of the optimal submodular flow problem. Like the network simplex method for solving… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)