Criss-cross methods: A fresh view on pivot algorithms (Q1365063): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4188659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial abstraction of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientability of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex method. A probabilistic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and Degeneracy in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex algorithm with a new primal and dual pivot rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Edmonds-Fukuda pivoting rule for simplex algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric dual quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient matrices and the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finiteness of the criss-cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal behaviors of Murty's least index method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all common bases in two matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: EP theorems and linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear complementarity problem, sufficient matrices, and the criss- cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite criss-cross method for hyperbolic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-polynomial bound for the diameter\\of graphs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the criss-cross method for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>d</i>-Step Conjecture and Its Relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5608986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry and positive definiteness in oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of parametric linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential example for Terlaky's pivoting rule for the criss-cross simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent criss-cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite crisscross method for oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point methods of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot rules for linear programming: A survey on recent theoretical developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity in Oriented Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear quadratic programming in oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Convergence of the Ford-Fulkerson Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof for the criss-cross method for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ *\)-matrices are just sufficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general deterministic pivot method for oriented matroid programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3622260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On anti-cycling pivoting rules for the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Criss-Cross Method for Solving Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Empirical Tests of the Criss-Cross Method / rank
 
Normal rank

Revision as of 17:29, 27 May 2024

scientific article
Language Label Description Also known as
English
Criss-cross methods: A fresh view on pivot algorithms
scientific article

    Statements

    Criss-cross methods: A fresh view on pivot algorithms (English)
    0 references
    0 references
    0 references
    1 June 1998
    0 references
    oriented matroids
    0 references
    pivot rules
    0 references
    cycling
    0 references
    recursion
    0 references
    criss-cross method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references