A randomized polynomial-time simplex algorithm for linear programming
From MaRDI portal
Publication:2931369
DOI10.1145/1132516.1132524zbMath1301.68262OpenAlexW2139819161MaRDI QIDQ2931369
Jonathan A. Kelner, Daniel A. Spielman
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132524
Related Items (12)
From Parity and Payoff Games to Linear Programming ⋮ Set-valued state estimation of nonlinear discrete-time systems with nonlinear invariants based on constrained zonotopes ⋮ An exponential lower bound for Zadeh's pivot rule ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ A double-pivot simplex algorithm and its upper bounds of the iteration numbers ⋮ George Dantzig's impact on the theory of computation ⋮ Guaranteed methods based on constrained zonotopes for set-valued state estimation of nonlinear discrete-time systems ⋮ Projective re-normalization for improving the behavior of a homogeneous conic linear system ⋮ A space decomposition-based deterministic algorithm for solving linear optimization problems ⋮ Moser's shadow problem ⋮ A characterization theorem and an algorithm for a convex hull problem ⋮ Bayesian knowledge base tuning
This page was built for publication: A randomized polynomial-time simplex algorithm for linear programming
