Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
pivot selection
Description:
The choice of a pivot element or item during an algorithm, such as selecting a partitioning element in quicksort.
Related topics:
Advanced Optimization Algorithms Research (19%),
Matrix Theory and Algorithms (14%),
Algorithms and Data Compression (12%),
Complexity and Algorithms in Graphs (12%),
Optimization and Mathematical Programming (11%)
OpenAlex ID:
keywords/pivot-selection
Algorithm 64: Quicksort
1961
·
C. A. R. Hoare
·
Communications of the ACM
·
688
Mathematical Programming
1998
·
Alexander S. Belenky
·
Applied optimization
·
590
On Fast Factorization Pivoting Methods for Sparse Symmetric Indefinite Systems
2006
·
Olaf Schenk
, Klaus Gärtner
·
ETNA - Electronic Transactions on Numerical Analysis
·
567
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
2004
·
Timothy A. Davis
·
ACM Transactions on Mathematical Software
·
467
Introspective Sorting and Selection Algorithms
1997
·
DAVID R. MUSSER
·
Software Practice and Experience
·
340
Pivot selection methods of the Devex LP code
1973
·
Paula M. J. Harris
·
Mathematical Programming
·
279
Steepest-edge simplex algorithms for linear programming
1992
·
John J. Forrest
, Donald Goldfarb
·
Mathematical Programming
·
239
Parallel sorting by regular sampling
1992
·
Hanmao Shi
, Jonathan Schaeffer
·
Journal of Parallel and Distributed Computing
·
236
Computational Techniques of the Simplex Method
2003
·
István Maros
·
International series in management science/operations research/International series in operations research & management science
·
219
Pivot selection techniques for proximity searching in metric spaces
2003
·
Benjamin Bustos
, Gonzalo Navarro
, et al.
·
Pattern Recognition Letters
·
213
PDF
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
1982
·
J. K. Reid
·
Mathematical Programming
·
198
Perfect Elimination and Chordal Bipartite Graphs
1978
·
Martin Charles Golumbic
, Clinton F. Goss
·
Journal of Graph Theory
·
189
Notes on Bland’s pivoting rule
1978
·
D. Avis
, V. Chvátal
·
Mathematical programming studies
·
176
Reinversion with the preassigned pivot procedure
1971
·
Eli Hellerman
, Dennis Rarick
·
Mathematical Programming
·
163
On simple linear programming problems
1963
·
A. J. Hoffman
·
Proceedings of symposia in pure mathematics
·
160
Cycling in the dual simplex algorithm
1955
·
E. M. L. Beale
·
Naval Research Logistics Quarterly
·
152
Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
1973
·
V. Srinivasan
, G. L. Thompson
·
Journal of the ACM
·
143
PDF
A Technique for Resolving Degeneracy in Linear Programming
1963
·
Philip Wolfe
·
Journal of the Society for Industrial and Applied Mathematics
·
136
A new pivoting strategy for Gaussian elimination
1996
·
Markus Olschowka
, Arnold Neumaier
·
Linear Algebra and its Applications
·
135
PDF
Fourier's Method of Linear Programming and Its Dual
1986
·
H. P. Williams
·
American Mathematical Monthly
·
131
14 . An Extension of a Theorem of Dantzig’s
1957
·
I. Heller
, C. B. Tompkins
·
Princeton University Press eBooks
·
122
On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
1980
·
Zahari Zlatev
·
SIAM Journal on Numerical Analysis
·
118
Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
2005
·
Iain S. Duff
, Stéphane Pralet
·
SIAM Journal on Matrix Analysis and Applications
·
116
Ordering Methods for Preconditioned Conjugate Gradient Methods Applied to Unstructured Grid Problems
1992
·
E. F. D’Azevedo
, P. A. Forsyth
, et al.
·
SIAM Journal on Matrix Analysis and Applications
·
108
Computing Strongly Connected Components in Parallel on CUDA
2011
·
Jiri Barnat
, Petr Bauch
, et al.
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
104
Show more works
View as search
Works count:
1,076
Citation count:
11,750
Year
Topic
Type