Linear programming — Randomization and abstract frameworks
From MaRDI portal
Publication:4593969
DOI10.1007/3-540-60922-9_54zbMATH Open1380.90184OpenAlexW1533912360MaRDI QIDQ4593969FDOQ4593969
Authors: B. Gärtner, Emo Welzl 
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
Recommendations
- A randomized algorithm for fixed-dimensional linear programming
- Random projections for linear programming
- A randomized polynomial-time simplex algorithm for linear programming
- scientific article; zbMATH DE number 4074817
- On linear programs with random costs
- scientific article; zbMATH DE number 1003270
- scientific article; zbMATH DE number 176291
- Random linear programs with many variables and few constraints
- Randomized combinatorial algorithms for linear programming when the dimension is moderately high
- scientific article; zbMATH DE number 1487878
Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (17)
- Learning fixed-dimension linear thresholds from fragmented data
- A randomized polynomial-time simplex algorithm for linear programming
- Helly-type theorems for approximate covering
- Title not available (Why is that?)
- Exact primitives for smallest enclosing ellipses
- A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
- Violator spaces: Structure and algorithms
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- Unique sink orientations of grids
- A randomized center path method for a class of linear programming problems
- Clarkson's algorithm for violator spaces
- Random sampling with removal
- Random linear programs with many variables and few constraints
- Random edge can be exponential on abstract cubes
- The 2-center problem in three dimensions
- Title not available (Why is that?)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
This page was built for publication: Linear programming — Randomization and abstract frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593969)
