Skip to search formSkip to main contentSkip to account menu

Criss-cross algorithm

Known as: Criss-cross, Crisscross algorithm, Criss cross method 
In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
This paper studies the problem of constructing codes correcting deletions in arrays. Under this model, it is assumed that an n… 
2006
2006
This paper addresses the problem of optimizing the navigation of an intelligent mobile in a real world environment, described by… 
Highly Cited
2003
Highly Cited
2003
In order to fit the small cross-center-biased characteristic of the real world video sequences, an improved version of the well… 
2003
2003
Nuclear receptors function as ligand-regulated transcription factors and modulate the expression of sets of genes in response to… 
1999
1999
Abstract. A method for passing a smooth surface through cross-sectional curves is presented. Cross-boundary derivatives across… 
1994
1994
The novel application of a digital speckle correlation method (DSCM) was demonstrated for the in-situ and nondestructive… 
1992
1992
Three generalizations of the criss-cross method for quadratic programming are presented here. Tucker’s, Cottle’s and Dantzig’s… 
1989
1989
  • Emil KlafszkyT. Terlaky
  • 1989
  • Corpus ID: 37080613
Quadratic programming, symmetry, positive (semi) definiteness and the linear complementary problem were generalized by Morris and…