Conference paper
Patterning of highly conducting polyaniline films
T. Graham, A. Afzali, et al.
Microlithography 2000
Crossover events for a linear programming problem were introduced by Vavasis and Ye and provide important insight into the behavior of the path of centers. The complexity of a layered-step interior-point algorithm presented by them depends on the number of disjoint crossover events and the coefficient matrix A, but not on b and c. In this short note, we present a linear programming instance with more than n2/8 disjoint crossover events. © 1996 Academic Press, Inc.
T. Graham, A. Afzali, et al.
Microlithography 2000
Dorit S. Hochbaum, Nimrod Megiddo, et al.
Mathematical Programming
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
A.R. Conn, Nick Gould, et al.
Mathematics of Computation