An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
type: Item
instance of: scholarly article
title: An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
zbMATH Open document ID: 0696.90035
DOI: 10.1007/BF01585729
author: N. E. Zubov
published in: Mathematical Programming. Series A. Series B
publication date: 1990-01-01T00:00:00Z
review text: This paper shows that the required number of iterations for Terlaky's pivoting rule for the criss-cross simplex method [see \textit{E. Klafszky} and \textit{T. Terlaky}, Alkalmazott Mat. Lapok 12, 1-14 (1986; Zbl 0631.90039)] may be exponential in the number of variables and constraints of the linear programming problem.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4141786
zbMATH Keywords: Gray code
zbMATH Keywords: Terlaky's pivoting rule
zbMATH Keywords: criss-cross simplex method
Wikidata QID: Q56080060
MaRDI profile type: Publication
cites work: Q4188659
cites work: Efficient generation of the binary reflected gray code and its applications
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Worst case behavior of the steepest edge simplex method
cites work: Q4051879
cites work: Some Simple Applications of the Travelling Salesman Problem
cites work: A convergent criss-cross method
cites work: The Criss-Cross Method for Solving Linear Programming Problems
full work available at URL: https://doi.org/10.1007/bf01585729
OpenAlex ID: W2067442388
description: scientific article; zbMATH DE number 4141786