Monday, May 10

CP12
Interior Point Methods for Linear Programming II

5:30 PM-7:30 PM
Room: Georgia 1 & 2
Chair: Michael J. Todd, Cornell University

5:30-5:45 Linear Programming, Integer Programming, and Constraint Programming: Program ¹ Program
Irvin Lustig, ILOG CPLEX Division, Incline Village, Nevada
5:50-6:05 A Characterization of the ``Smallest Large Variable''Condition Number in Linear Programming
Hugo J. Lara, Universidad Centro Occidental Lisandro Alvarado, Venezuela; Clovis C. Gonzaga, Federal University of Santa Catarina, Brazil
6:10-6:25 Multiple Cuts in The Analytic Center Cutting Plane Method
Jean-Louis Goffin, McGill University, Montréal, Canada; and Jean-Philippe Vial, University of Geneva, Switzerland
6:30-6:45 A Center Cutting Plane Algorithm for the Likelihood Estimate Problem
Fernanda M. Pereira Raupp, Laboratório Nacional de Computação Científica - CNPq, Petrópolis, RJ, Brasil; and Clovis C. Gonzaga, Universidade Federal de Santa Catarina, Florianópolis, Brasil
6:50-7:05 Riemannian Geometry and The Complexity of Interior-Point Methods
Yurii E. Nesterov, Universite Catholique de Louvain, Belgium; and Michael J. Todd, Cornell University
7:10-7:25 Some Remarks On Construction of Central Path for Linear Programming
J.N. Singh, Ahmadu Bello University, Zaria, Nigeria

OP99 Home

Program

Program Updates

Speaker Index

Hotel

Transportation

Registration

 
MMD Created: 12/2/98 Updated: 2/2/99