An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

DOI10.1007/BF01585729zbMath0696.90035WikidataQ56080060 ScholiaQ56080060MaRDI QIDQ911455

N. E. Zubov

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

Gray code; criss-cross simplex method; Terlaky's pivoting rule

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C05: Linear programming

Related Items

A new proof for the criss-cross method for quadratic programming, Pivot rules for linear programming: A survey on recent theoretical developments, An exterior point simplex algorithm for (general) linear programming problems, On extremal behaviors of Murty's least index method, Criss-cross methods: A fresh view on pivot algorithms, An efficient simplex type algorithm for sparse and dense linear programs., The role of pivoting in proving some fundamental theorems of linear algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Worst case behavior of the steepest edge simplex method
• The Criss-Cross Method for Solving Linear Programming Problems
• A convergent criss-cross method
• Some Simple Applications of the Travelling Salesman Problem
• Efficient generation of the binary reflected gray code and its applications
• New Finite Pivoting Rules for the Simplex Method