Linear programming — Randomization and abstract frameworks
From MaRDI portal
Publication:4593969
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
Cited in
(17)- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Learning fixed-dimension linear thresholds from fragmented data
- A randomized polynomial-time simplex algorithm for linear programming
- Helly-type theorems for approximate covering
- scientific article; zbMATH DE number 1003270 (Why is no real title available?)
- 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
- Clarkson's algorithm for violator spaces
- Random sampling with removal
- A randomized center path method for a class of linear programming problems
- Random linear programs with many variables and few constraints
- The 2-center problem in three dimensions
- Random edge can be exponential on abstract cubes
- scientific article; zbMATH DE number 1775049 (Why is no real title available?)
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)