Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
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.
Hendrik F. Hamann
InterPACK 2013
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007