Anstreicher Kurt M.

Kurt M. Anstreicher

Information about the author Kurt M. Anstreicher will soon be added to the site.
Found 13 papers in total
An improved algorithm for computing Steiner minimal trees in Euclidean d-space
An improved algorithm for computing Steiner minimal trees in Euclidean d-space
2008
We describe improvements to Smith's branch-and-bound (B&B) algorithm for the...
A partial updating algorithm for linear programs with many more variables than constraints
A partial updating algorithm for linear programs with many more variables than constraints
1995
We present a modified version of Ye's potential reduction algorithm for linear...
Volumetric path following algorithms for linear programming
Volumetric path following algorithms for linear programming
1997
We consider the construction of small step path following algorithms using volumetric,...
Large step volumetric potential reduction algorithms for linear programming
Large step volumetric potential reduction algorithms for linear programming
1996
The paper considers the construction of potential reduction algorithms using...
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
1993
In a recent paper, Shaw and Goldfarb show that a version of the standard form...
A family of search directions for Karmarkar’s algorithm
A family of search directions for Karmarkar’s algorithm
1993
The authors consider a new family of search directions for the standard form variant...
Long steps in an O(n3L) algorithm for linear programming
Long steps in an O(n3L) algorithm for linear programming
1992
The authors consider partial updating in Ye’s affine potential reduction...
On interior algorithms for linear programming with no regularity assumptions
On interior algorithms for linear programming with no regularity assumptions
1992
The linear programming algorithm of Karmarkar, and all interior methods subsequently...
Crashing a maximum-weight complementary basis
Crashing a maximum-weight complementary basis
1992
The authors consider the problem of finding a maximum-weight complementary basis of an...
A combined phase I-phase II scaled potential algorithm for linear programming
A combined phase I-phase II scaled potential algorithm for linear programming
1991
The paper develops an extension of the affinely scaled potential reduction algorithm...
A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
1990
In his original analysis of the projective algorithm for linear programming, Karmarkar...
The worst-case step in Karmarkar’s algorithm
The worst-case step in Karmarkar’s algorithm
1989
In this note the worst-case performance in a single step of Karmarkar’s...
A combined phase I-phase II projective algorithm for linear programming
A combined phase I-phase II projective algorithm for linear programming
1989
We devise a projective algorithm which explicitly considers the constraint that an...
Papers per page: