Elliot Linzer, M. Vetterli
Computing
The random simplex algorithm for linear programming proceeds as follows: at each step, it moves from a vertex v of the polytope to a randomly chosen neighbor of v, the random choice being made from those neighbors of v that improve the objective function. We exhibit a polytope defined by n constraints in three dimensions with height O(log n), for which the expected running time of the random simplex algorithm is Ω( n log n). © 1995.
Elliot Linzer, M. Vetterli
Computing
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009