Vortragende/r | Thema |
---|---|
Saska Wensierski | B. Jansen, C. Roos, T. Terlaky und J.-P. Vial: Primal-Dual Target-Following Algorithms for Linear Programming |
Oleg Mänz | Tamra J. Carpenter, Irvin J. Lustig, John M. Mulvey und David F. Shanno: Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives |
Gerald Stein | Kurt M. Anstreicher: Linear Programming in O (n3 / lnn L) Operations |
Jan Radonz | Stephen G. Nash und Ariela Sofer: On the complexity of a practical interior-point method |
Stephan Meyer | . D. Andersen, J. Gondzio, C. Meszaros, X. Xu: Implementation of Interior Point Methods for Large Scale Linear Programming |
Armin Kubrak | E. D. Andersen und K. D. Andersen: The APOS linear programming solver: an implementation of the homogeneous algorithm |
Sven Oergel | John E. Mitchell und Brian Borchers: Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm |
Dagmar Timmreck | J. Gondzio: Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method |
Tobias Pfender | Stephen A. Vavasis und Yinyu Ye: A Primal-Dual Accelerated Interior Point Method Whose Running Time Depends Only on A* und Stephen A. Vavasis und Yinyu Ye: A simplification to ``a Primal-Dual Interior Point Method Whose Running Time Depends Only on the Constraint Matrix'' |
Bernhard Luther | Yinyu Ye: How partial knowledge helps to solve linear programs |