Title: Computational Progress in Linear and Mixed Integer Programming


Speaker: Bob Bixby

Date: August 12
Time: 10:00 - 11:00
Room: Ballroom B

Chair: Martin Grötschel


Abstract: We describe progress in linear and mixed-integer programming (MIP) algorithms and software over the last 25 years. As a result of this progress, modern linear programming (LP) codes are now capable of robustly and efficiently solving instances with multiple millions of variables and constraints. With these LP advances as a foundation, MIP then provides a mathematical framework that enables the representation and solution to provable optimality of a wide range of real-world planning and scheduling models, this in spite of the fact that MIP is NP-hard. Describing the remarkable performance improvements in MIP over the last 25 years and the mathematical underpinnings will central to this talk.

Return

Key Features:
Awarding ceremony of ICIAM prizes
Invited lectures
Prize lectures
Industrial Minisymposia
Contributed Minisymposia
Poster sessions
Embedded and satellite meetings
Public outreach sessions
Exhibits