| 2009 |
|---|
| 20 | EE | Kurt M. Anstreicher:
Linear Programming: Interior Point Methods.
Encyclopedia of Optimization 2009: 1886-1889 |
| 19 | EE | Kurt M. Anstreicher:
Linear Programming: Karmarkar Projective Algorithm.
Encyclopedia of Optimization 2009: 1889-1891 |
| 2008 |
|---|
| 18 | EE | Marcia Fampa,
Kurt M. Anstreicher:
An improved algorithm for computing Steiner minimal trees in Euclidean d-space.
Discrete Optimization 5(2): 530-540 (2008) |
| 17 | EE | Kurt M. Anstreicher,
Alfredo N. Iusem:
Continuous optimization: 5th Brazilian workshop.
Math. Program. 111(1-2): 1-4 (2008) |
| 2004 |
|---|
| 16 | EE | Kurt M. Anstreicher:
The Thirteen Spheres: A New Proof.
Discrete & Computational Geometry 31(4): 613-625 (2004) |
| 15 | EE | Kurt M. Anstreicher:
The volumetric barrier for convex quadratic constraints.
Math. Program. 100(3): 613-662 (2004) |
| 2002 |
|---|
| 14 | EE | Kurt M. Anstreicher:
Improved Linear Programming Bounds for Antipodal Spherical Codes.
Discrete & Computational Geometry 28(1): 107-114 (2002) |
| 2001 |
|---|
| 13 | | Kurt M. Anstreicher,
Marcia Fampa,
Jon Lee,
Joy Williams:
Maximum-entropy remote sampling.
Discrete Applied Mathematics 108(3): 211-226 (2001) |
| 2000 |
|---|
| 12 | EE | Kurt M. Anstreicher:
The Volumetric Barrier for Semidefinite Programming.
Math. Oper. Res. 25(3): 365-380 (2000) |
| 1996 |
|---|
| 11 | | Kurt M. Anstreicher,
Marcia Fampa,
Jon Lee,
Joy Williams:
Continuous Relaxations for Constrained Maximum-Entropy Sampling.
IPCO 1996: 234-248 |
| 10 | | Kurt M. Anstreicher:
Volumetric path following algorithms for linear programming.
Math. Program. 76: 245-263 (1996) |
| 1993 |
|---|
| 9 | | Kurt M. Anstreicher,
Dick den Hertog,
Cornelis Roos,
Tamás Terlaky:
A Long-Step Barrier Method for Convex Quadratic Programming.
Algorithmica 10(5): 365-382 (1993) |
| 8 | | Robert A. Bosch,
Kurt M. Anstreicher:
On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise.
Algorithmica 9(2): 184-197 (1993) |
| 7 | | Kurt M. Anstreicher:
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming.
Math. Program. 62: 517-535 (1993) |
| 6 | | Yinyu Ye,
Kurt M. Anstreicher:
On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP.
Math. Program. 62: 537-551 (1993) |
| 1992 |
|---|
| 5 | | Kurt M. Anstreicher,
Robert A. Bosch:
Long steps in an O(n3L) algorithm for linear programming.
Math. Program. 54: 251-265 (1992) |
| 4 | | Kurt M. Anstreicher,
Jon Lee,
Thomas F. Rutherford:
Crashing a maximum-weight complementary basis.
Math. Program. 54: 281-294 (1992) |
| 1991 |
|---|
| 3 | | Kurt M. Anstreicher:
A combined phase I-phase II scaled potential algorithm for linear programming.
Math. Program. 52: 429-439 (1991) |
| 1990 |
|---|
| 2 | | Kurt M. Anstreicher:
A Standard Form Variant, and Safeguarded Linesearch, for the Modified Karmarkar Algorithm.
Math. Program. 47: 337-351 (1990) |
| 1986 |
|---|
| 1 | | Kurt M. Anstreicher:
A Monotonic Projective Algorithm for Fractional Linear Programming.
Algorithmica 1(4): 483-498 (1986) |
