Linear programming — Randomization and abstract frameworks
From MaRDI portal
Publication:4593969
DOI10.1007/3-540-60922-9_54zbMath1380.90184MaRDI QIDQ4593969
Publication date: 16 November 2017
Published in: STACS 96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60922-9_54
68Q25: Analysis of algorithms and problem complexity
90C60: Abstract computational complexity for mathematical programming problems
90C30: Nonlinear programming
90C05: Linear programming
68W20: Randomized algorithms
Related Items
Helly-type theorems for approximate covering, Exact primitives for smallest enclosing ellipses, Clarkson's algorithm for violator spaces, Unique sink orientations of grids, Violator spaces: Structure and algorithms, Learning fixed-dimension linear thresholds from fragmented data, A distributed simplex algorithm for degenerate linear programs and multi-agent assignments, The 2-center problem in three dimensions, Random edge can be exponential on abstract cubes