|
7
|
A Survey on Pivot Rules for Linear Programming
– T. Terlaky, Shuzhong Zhang
- 1991
|
|
|
Criss-Cross Pivoting Rules
– T. Terlaky
|
|
|
Linear Programming: Pivoting on . . .
– Bohdan Lubomyr Kaluzny
|
|
8
|
Lower Bounds for Fundamental Geometric Problems
– Jeffrey Gordon Erickson
- 1996
|
|
19
|
Frequently asked questions in polyhedral computation
– Komei Fukuda
- 2000
|
|
13
|
Some Generalizations Of The Criss-Cross Method For Quadratic Programming
– Emil Klafszky, Tamás Terlaky
- 1992
|
|
4
|
A Monotonic Build-Up Simplex Algorithm for Linear Programming
– K. M. Anstreicher, T. Terlaky
- 1991
|
|
66
|
How good are convex hull algorithms?
– David Avis, David Bremner, Raimund Seidel
- 1996
|
|
26
|
New Lower Bounds for Convex Hull Problems in Odd Dimensions
– Jeff Erickson
- 1996
|
|
|
Edmonds Fukuda Rule And A General Recursion For Quadratic Programming
– Komei Fukuda, Tamás Terlaky
|
|
12
|
Linear Complementarity and Oriented Matroids
– Komei Fukuda, Tamas Terlaky
- 1990
|
|
1
|
Combinatorial Maximum Improvement Algorithm for LP and LCP
– Komei Fukuda, Hans-Jakob Lüthi
- 1995
|
|
2
|
On the complexity of vertex and facet enumeration for convex polytopes
– David D. Bremner
- 1997
|
|
3
|
Output-Sensitive Construction Of Convex Hulls
– Timothy Moon-yew Chan
- 1995
|
|
356
|
Applications of Random Sampling in Computational Geometry, II
– Kenneth L. Clarkson, Peter W. Shor
- 1995
|
|
244
|
Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms
– Herbert Edelsbrunner, Ernst Peter Mücke
- 1990
|
|
71
|
Arrangements and Their Applications
– Pankaj K. Agarwal, Micha Sharir
- 1998
|
|
|
The Finite Criss-Cross Method for Hyperbolic Programming
– T. Illes, Á. Szirmai, A. Szirmai, T. Terlaky, T. Terlaky, Akos Szirmai
- 1996
|
|
7
|
The Linear Complementarity Problem, Sufficient Matrices and the Criss-Cross Method
– D. Den Hertog, C. Roos, C. Roos, T. Terlaky, T. Terlaky
- 1990
|
