Results 1  10
of
350
An improved version of the RandomFacet pivoting rule for the simplex algorithm
, 2015
"... The RandomFacet pivoting rule of Kalai and of Matoušek, Sharir and Welzl is an elegant randomized pivoting rule for the simplex algorithm, the classical combinatorial algorithm for solving linear programs (LPs). The expected number of pivoting steps performed by the simplex algorithm when using th ..."
Abstract
 Add to MetaCart
The RandomFacet pivoting rule of Kalai and of Matoušek, Sharir and Welzl is an elegant randomized pivoting rule for the simplex algorithm, the classical combinatorial algorithm for solving linear programs (LPs). The expected number of pivoting steps performed by the simplex algorithm when using
THE RANDOM EDGE SIMPLEX ALGORITHM ON DUAL CYCLIC 4POLYTOPES
, 2006
"... The simplex algorithm using the random edge pivotrule on any realization of a dual cyclic 4polytope with n facets does not take more than O(n) pivotsteps. This even holds for general abstract objective functions (AOF) / acyclic unique sink orientations (AUSO). The methods can be used to show a ..."
Abstract
 Add to MetaCart
The simplex algorithm using the random edge pivotrule on any realization of a dual cyclic 4polytope with n facets does not take more than O(n) pivotsteps. This even holds for general abstract objective functions (AOF) / acyclic unique sink orientations (AUSO). The methods can be used to show
The Quickhull algorithm for convex hulls
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1996
"... The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the twodimensional Quickhull Algorithm with the generaldimension BeneathBeyond Algorithm. It is similar to the randomized, incremental algo ..."
Abstract

Cited by 713 (0 self)
 Add to MetaCart
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the twodimensional Quickhull Algorithm with the generaldimension BeneathBeyond Algorithm. It is similar to the randomized, incremental
A Discourse on the Pivot Rules RANDOM EDGE and RANDOM FACET
, 2000
"... This technical report is a summary of most of the topics I was working on during my first year at the ETH. Hopefully, I hope to expand on some of them during my dissertation. It is, therefore, to be regarded as work in progress. The largest section is about finding new nontrivial bounds for Random E ..."
Abstract
 Add to MetaCart
Edge. It opens, however, with a few facts we observed when looking at orientations on the hypercube and their impact on the behaviour of randomized pivot rules. The final section is dedicated to some ideas connected to Balinski's Theorem and other path properties on oriented polytopes. 3 Chapter
Random Walks in PeertoPeer Networks
, 2004
"... We quantify the effectiveness of random walks for searching and construction of unstructured peertopeer (P2P) networks. For searching, we argue that random walks achieve improvement over flooding in the case of clustered overlay topologies and in the case of reissuing the same request several tim ..."
Abstract

Cited by 226 (3 self)
 Add to MetaCart
in complexity theory for construction of pseudorandom number generators. We reveal another facet of this theory and translate savings in random bits to savings in processing overhead.
A Subexponential Bound for Linear Programming
 ALGORITHMICA
, 1996
"... We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected min{O(d 2 2 d n),e 2 d ln(n / d)+O ( d+ln n)} time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input); to be precise, the algorith ..."
Abstract

Cited by 185 (15 self)
 Add to MetaCart
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected min{O(d 2 2 d n),e 2 d ln(n / d)+O ( d+ln n)} time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input); to be precise
PIVOTING RULES FOR THE REVISED SIMPLEX ALGORITHM
, 2014
"... Abstract. Pricing is a significant step in the simplex algorithm where an improving nonbasic variable is selected in order to enter the basis. This step is crucial and can dictate the total execution time. In this paper, we perform a computational study in which the pricing operation is computed wi ..."
Abstract
 Add to MetaCart
with eight different pivoting rules: (i) Bland’s Rule, (ii) Dantzig’s Rule, (iii) Greatest Increment Method, (iv) Least Recently Considered Method, (v) Partial Pricing Rule, (vi) Queue Rule, (vii) Stack Rule, and (viii) Steepest Edge Rule; and incorporate them with the revised simplex algorithm. All pivoting
NOTES ON BLAND'S PIVOTING RULE
, 1978
"... Recently R.G. Bland proposed two new rules for pivot selection in the simplex method. These elegant rules arise from Bland's work on oriented matroids; their virtue is that they never lead to cycling. We investigate the efficiency of the first of them. On randomly generated problems with 50 non ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
Recently R.G. Bland proposed two new rules for pivot selection in the simplex method. These elegant rules arise from Bland's work on oriented matroids; their virtue is that they never lead to cycling. We investigate the efficiency of the first of them. On randomly generated problems with 50
Randomized Trial of Radiofrequency Lumbar Facet
"... Study Design. A prospective doubleblind randomized trial in 31 patients. Objectives. To assess the clinical efficacy of percutaneous radiofrequency denervation of the lumbar zygapophysial joints in reducing pain, functional disability, and physical impairment in patients with back pain originati ..."
Abstract
 Add to MetaCart
Study Design. A prospective doubleblind randomized trial in 31 patients. Objectives. To assess the clinical efficacy of percutaneous radiofrequency denervation of the lumbar zygapophysial joints in reducing pain, functional disability, and physical impairment in patients with back pain orig
Results 1  10
of
350