A finite crisscross method for oriented matroids

DOI10.1016/0095-8956(87)90049-9zbMath0588.05010OpenAlexW2064953601WikidataQ60306608 ScholiaQ60306608MaRDI QIDQ1073036

Tamás Terlaky

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90049-9

zbMATH Keywords

baseoriented matroidspivotingfinite criss-cross methodpivot ruleanty cycling ruledual feasible cocircuitgeneral duality theoremoptimal oriented circuitsprimal feasible circuit

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (17)

The role of pivoting in proving some fundamental theorems of linear algebra ⋮ Criss-cross methods: A fresh view on pivot algorithms ⋮ Combinatorial redundancy detection ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ Some generalizations of the criss-cross method for quadratic programming ⋮ On the finiteness of the criss-cross method ⋮ Parametric simplex algorithms for solving a special class of nonconvex minimization problems ⋮ A basis enumeration algorithm for linear systems with geometric applications ⋮ A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra ⋮ On circuit valuation of matroids ⋮ The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP ⋮ Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids ⋮ The linear complementarity problem, sufficient matrices, and the criss- cross method ⋮ The finite criss-cross method for hyperbolic programming ⋮ Variants of the Hungarian method for solving linear programming problems ⋮ Pivot rules for linear programming: A survey on recent theoretical developments ⋮ New variants of finite criss-cross pivot algorithms for linear programming

Cites Work

• Unnamed Item
• Oriented matroids
• Orientability of matroids
• A combinatorial abstraction of linear programming
• The Criss-Cross Method for Solving Linear Programming Problems
• Complementarity in Oriented Matroids
• A convergent criss-cross method
• New Finite Pivoting Rules for the Simplex Method
• Lectures on matroids
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Some Empirical Tests of the Criss-Cross Method

This page was built for publication: A finite crisscross method for oriented matroids