261 search results - page 1 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
MP
2008
13 years 4 months ago
2008
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
SIAMCOMP
2008
13 years 4 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
JCT
2000
13 years 4 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...