The Complexity of the Simplex Method
From MaRDI portal
Publication:2941508
DOI10.1145/2746539.2746558zbMath1321.90079arXiv1404.0605OpenAlexW2061874298MaRDI QIDQ2941508
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.0605
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Markov and semi-Markov decision processes (90C40)
Related Items (10)
Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems ⋮ Automatic verification of concurrent stochastic systems ⋮ An exponential lower bound for Zadeh's pivot rule ⋮ The Polyhedral Geometry of Pivot Rules and Monotone Paths ⋮ Inapproximability of shortest paths on perfect matching polytopes ⋮ Unnamed Item ⋮ Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm ⋮ On the Complexity of Value Iteration ⋮ On the Length of Monotone Paths in Polyhedra ⋮ Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
This page was built for publication: The Complexity of the Simplex Method
