Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,212,279 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Assignment problem
Graph theory
Mathematical optimization
Minimum-cost flow problem
Expand
Broader (3)
Linear programming
Network theory
Operations research
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
A less-than-truckload carrier collaboration planning problem under dynamic capacities
Salvador Hernández
,
S. Peeta
,
George Kalafatas
2011
Corpus ID: 23242522
Highly Cited
2009
Highly Cited
2009
A two-phase algorithm for the biobjective integer minimum cost flow problem
A. Raith
,
M. Ehrgott
Computers & Operations Research
2009
Corpus ID: 18752125
Review
2007
Review
2007
Combinatorial Optimization: Theory and Algorithms
B. Korte
,
J. Vygen
2007
Corpus ID: 51010742
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with…
Expand
Highly Cited
2003
Highly Cited
2003
New stochastic models for capacitated location-allocation problem
Jian Zhou
,
Baoding Liu
Computers & industrial engineering
2003
Corpus ID: 9341096
1999
1999
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
D. Goldfarb
,
Zhiying Jin
Operational Research
1999
Corpus ID: 6457952
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…
Expand
Highly Cited
1997
Highly Cited
1997
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
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…
Expand
Highly Cited
1996
Highly Cited
1996
A polynomial time primal network simplex algorithm for minimum cost flows
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…
Expand
1992
1992
The Scaling Network Simplex Algorithm
R. Ahuja
,
J. Orlin
Operational Research
1992
Corpus ID: 20849154
In this paper, we present a new primal simplex pivot rule and analyze the worst case complexity of the resulting simplex…
Expand
Highly Cited
1989
Highly Cited
1989
A continuous-time network simplex algorithm
E. Anderson
,
A. Philpott
Networks
1989
Corpus ID: 31043293
Given a network having costs and upper bound constraints on the flows in its arcs, the minimum-cost network flow problem is that…
Expand
Highly Cited
1979
Highly Cited
1979
Theoretical Properties of the Network Simplex Method
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…
Expand
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)
ACCEPT & CONTINUE