Date and time: 3:00pm-4:30pm, Wednesday 1st November, 2006
Venue: 300.217
Abstract: Integer programs are notoriously difficult to solve. As part of my research, I have programmed several integer models, using Ilog's Cplex to obtain optimal solutions.
When searching for optimal solutions to programs, it may be helpful to know that the structure of the coefficient matrix has a strong effect on computational time. This information is largely ignored in the literature and integer program texts; although it is standard practice in linear algebra applications to aim for block diagonal structure in order to reduce matrix calculation time. In this presentation, I wish to explore some different structures and compare computational times. I welcome input and criticisms from attendees, as this is definitely a work in progress.
About the speaker: Christina Burt is a PhD candidate in the Department of Mathematics and Statistics, Curtin University of Technology.
Seminars are free and open to all postgraduate students in the Department of Computing and the Department of Mathematics and Statistics. No booking is necessary and biscuits, tea and coffee are provided. Seminars are as informal as the speaker desires. If you are not a postgraduate student and wish to attend a seminar you may only do so with the express permission of the relevant speaker(s).
If you are interested in giving a presentation in this seminar series, or to make suggestions for speakers, please contact Simon Puglisi (Computing): or Christina Burt (Maths):
the seminar co-ordinators. Seminars are normally held at 300.217 (building 300, level 2, room 217) - you can find where this is exactly using the Bentley campus map.
