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

DOI10.1007/BF01585729zbMath0696.90035OpenAlexW2067442388WikidataQ56080060 ScholiaQ56080060MaRDI QIDQ911455

N. E. Zubov

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1007/bf01585729

zbMATH Keywords

Gray codecriss-cross simplex methodTerlaky's pivoting rule

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Related Items (10)

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

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

This page was built for publication: An exponential example for Terlaky's pivoting rule for the criss-cross simplex method