Abstract of Talk by Cassandra Moore McZeal

On the Use of Interior Point Methods for Integer Programming

Department of Computational and Applied Mathematics
PO Box 1892, MS 134
Rice University  
Houston, Texas 77251-1892

Office Telephone Number:

Fax Number:

Electronic Mail Address:

There exist many algorithms for solving instances of mixed integer programming problems. Many are special purpose, but there is one algorithm that is widely used in almost all commercial codes: branch-and-cut. Currently, all commercial branch-and-cut algorithms are based on the simplex method. This talk focuses on the pros and cons of basing a branch-and-cut algorithm for mixed integer programming on an interior point method.

Go back to AARMS Menu