Pages that link to "Item:Q1073036"

The following pages link to A finite crisscross method for oriented matroids (Q1073036):

Displaying 13 items.

• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384507) (← links)
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
• On the finiteness of the criss-cross method (Q1176822) (← links)
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915) (← links)
• A basis enumeration algorithm for linear systems with geometric applications (Q1180318) (← links)
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
• The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
• New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) (← links)
• Combinatorial redundancy detection (Q1657399) (← links)
• The finite criss-cross method for hyperbolic programming (Q1809838) (← links)
• The role of pivoting in proving some fundamental theorems of linear algebra (Q2644727) (← links)