New variants of finite criss-cross pivot algorithms for linear programming
type: Item
instance of: scholarly article
title: New variants of finite criss-cross pivot algorithms for linear programming
zbMATH Open document ID: 1009.90070
DOI: 10.1016/S0377-2217(98)00026-5
published in: European Journal of Operational Research
publication date: 2002-08-18T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 1783255
zbMATH Keywords: linear programming
zbMATH Keywords: criss-cross pivot method
zbMATH Keywords: anti-cycling
author: Shuzhong Zhang
MaRDI profile type: Publication
Wikidata QID: Q62058796
cites work: On anti-cycling pivoting rules for the simplex method
cites work: The Criss-Cross Method for Solving Linear Programming Problems
cites work: A convergent criss-cross method
cites work: A finite conformal-elimination free algorithm over oriented matroid programming
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: A finite crisscross method for oriented matroids
cites work: The linear complementarity problem, sufficient matrices, and the criss- cross method
cites work: The role of pivoting in proving some fundamental theorems of linear algebra
cites work: Some generalizations of the criss-cross method for quadratic programming
cites work: Criss-cross methods: A fresh view on pivot algorithms
cites work: Pivot rules for linear programming: A survey on recent theoretical developments
cites work: On the finiteness of the criss-cross method
full work available at URL: s0377-2217(98)00026-5
OpenAlex ID: W2005922382
description: scientific article; zbMATH DE number 1783255