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)

Related topics

Related topics

26 relations
AlgorithmAverage-case complexityBland's ruleBuchberger's algorithm

Broader (2)

Combinatorial optimizationLinear programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The s-monotone index selection rules for pivot algorithms of linear programming
2008
2008
On the construction of local quadratic spline quasi-interpolants on bounded rectangular domains
Highly Cited
2003
Highly Cited
2003
A new cross-diamond search algorithm for fast block matching motion estimation
In order to fit the small cross-center-biased characteristic of the real world video sequences, an improved version of the well… 
2003
2003
Interactions of exogenous endocrine active substances with nuclear receptors
Nuclear receptors function as ligand-regulated transcription factors and modulate the expression of sets of genes in response to… 
1999
1999
Cross-Sectional Design with Boundary Constraints
Abstract. A method for passing a smooth surface through cross-sectional curves is presented. Cross-boundary derivatives across… 
Highly Cited
1998
Highly Cited
1998
A TIME-DELAY NEURAL NETWORK ALGORITHM FOR REAL-TIME PEDESTRIAN RECOGNITION
This paper describes an algorithm for pedestrian recognition from sequences of grayscale stereo images taken from a pair of… 
1994
1994
Nondestructive detection of defects in miniaturized multilayer ceramic capacitors using digital speckle correlation techniques
The novel application of a digital speckle correlation method (DSCM) was demonstrated for the in-situ and nondestructive… 
1992
1992
Some generalizations of the criss-cross method for quadratic programming
Three generalizations of the criss-cross method for quadratic programming are presented here. Tucker’s, Cottle’s and Dantzig’s… 
1989
1989
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
  • Emil KlafszkyT. Terlaky
  • Comb.
  • 1989
  • Corpus ID: 37080613
Quadratic programming, symmetry, positive (semi) definiteness and the linear complementary problem were generalized by Morris and… 
1941
1941
The Interaction of Neurones
That neurones interact is obvious from the simple consideration that each of you has several billion neurones in your cerebral… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)