Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
pivot rules
Description:
Rules that determine which pivot operation to perform during the simplex method for solving linear programming problems.
Primary topic:
Complexity and Algorithms in Graphs (52%)
Related topics:
Complexity and Algorithms in Graphs (52%),
Advanced Optimization Algorithms Research (28%)
OpenAlex ID:
keywords/pivot-rules
How Good Is the Simplex Algorithm
1970
·
Victor Klee
, George J. Minty
·
1,076
Bouc–Wen-Type Models with Stiffness Degradation: Thermodynamic Analysis and Applications
2008
·
Silvano Erlicher
, Oreste S. Bursi
·
Journal of Engineering Mechanics
·
242
PDF
Linear Programming
2001
·
Robert J. Vanderbei
·
International series in management science/operations research/International series in operations research & management science
·
221
A subexponential randomized simplex algorithm (extended abstract)
1992
·
Gil Kalai
·
ACM Symposium on Theory of Computing (STOC)
·
211
The simplex algorithm with the pivot rule of maximizing criterion improvement
1973
·
R.G. Jeroslow
·
Discrete Mathematics
·
203
PDF
Pivot rules for linear programming: A survey on recent theoretical developments
1993
·
Tamás Terlaky
, Shuzhong Zhang
·
Annals of Operations Research
·
181
Generalized Networks: A Fundamental Computer-Based Planning Tool
1978
·
F. Glover
, J. Hultz
, et al.
·
Management Science
·
140
Deformed products and maximal shadows of polytopes
1999
·
Nina Amenta
, Günter M. Ziegler
·
Contemporary mathematics - American Mathematical Society
·
116
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
2011
·
Oliver Friedmann
, Thomas Dueholm Hansen
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
111
The Composite Simplex Algorithm
1965
·
Philip Wolfe
·
SIAM Review
·
96
Linear programming, the simplex algorithm and simple polytopes
1997
·
Gil Kalai
·
Mathematical Programming
·
91
An Algorithm for Scaling Matrices
1962
·
D. R. Fulkerson
, P. Wolfe
·
SIAM Review
·
82
On the simplex algorithm for networks and generalized networks
1985
·
James B. Orlin
·
Mathematical programming studies
·
80
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
1991
·
Andrew V. Goldberg
, Michael D. Grigoriadis
, et al.
·
Mathematical Programming
·
69
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
1990
·
C. Roos
·
Mathematical Programming
·
68
The Complexity of the Simplex Method
2015
·
John Fearnley
, Rahul Savani
·
ACM Symposium on Theory of Computing (STOC)
·
67
Polynomial dual network simplex algorithms
1993
·
James B. Orlin
, Serge A. Plotkin
, et al.
·
Mathematical Programming
·
61
A largest-distance pivot rule for the simplex algorithm
2007
·
Ping-Qi Pan
·
European Journal of Operational Research
·
56
The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
1997
·
Ping-Qi Pan
·
European Journal of Operational Research
·
52
Linear Programming: An Introduction to Finite Improvement Algorithms
1984
·
Daniel Solow
·
51
Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming
1957
·
A. Charnes
, W. W. Cooper
·
Econometrica
·
48
Linear Complementarity and Oriented Matroids
1992
·
Komei Fukuda
, Tamas Terlaky
·
Journal of the Operations Research Society of Japan
·
47
PDF
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
2022
·
Jesús A. De Loera
, Sean Kafer
, et al.
·
SIAM Journal on Optimization
·
45
PDF
What is the worst case behavior of the simplex algorithm?
2009
·
Norman Zadeh
·
CRM proceedings & lecture notes
·
45
An exponential lower bound for Zadeh’s pivot rule
2022
·
Yann Disser
, Oliver Friedmann
, et al.
·
Mathematical Programming
·
38
PDF
Show more works
View as search
Works count:
302
Citation count:
4,896
Year
Topic
Type