A double-pivot simplex algorithm and its upper bounds of the iteration numbers
From MaRDI portal
Publication:2214920
DOI10.1007/s40687-020-00235-2zbMath1454.90027arXiv1910.10097OpenAlexW3109383812MaRDI QIDQ2214920
Publication date: 10 December 2020
Published in: Research in the Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.10097
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A counterexample to the Hirsch conjecture
- The double pivot simplex method
- Worst case behavior of the steepest edge simplex method
- Randomized simplex algorithms on Klee-Minty cubes
- Pivot rules for linear programming: A survey on recent theoretical developments
- A bound for the number of different basic solutions generated by the simplex method
- The Hirsch conjecture has been disproved: an interview with Francisco Santos
- Klee-Minty's LP and upper bounds for Dantzig's simplex method
- Improving bounds on the diameter of a polyhedron in high dimensions
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- AN UPPER BOUND FOR THE NUMBER OF DIFFERENT SOLUTIONS GENERATED BY THE PRIMAL SIMPLEX METHOD WITH ANY SELECTION RULE OF ENTERING VARIABLES
- The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
- A randomized polynomial-time simplex algorithm for linear programming
- Pivoting rules for the revised simplex algorithm
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron
- Programming of Interdependent Activities: II Mathematical Model
This page was built for publication: A double-pivot simplex algorithm and its upper bounds of the iteration numbers
