Tuesday, May 11
MS26
Mixed Integer Programming
3:30 PM-5:30 PM
Room: Georgia 7
Mixed-integer programming deals with optimization problems in which
some or all of the variables are required to be integers. The first
talk of this minisymposium surveys developments that have taken place
in the last decade. The following three talks present new results. A
theme that is common to all of the talks is the use of disjunctions
in developing strong relaxations.
Organizers: George Nemhauser and Martin W. P. Savelsbergh
Georgia Institute of Technology
- 3:30-3:55 Progress in Linear Programming Based
Branch-and-Bound Algorithms: An Exposition
- M.W.P. Savelsbergh, E.L. Johnson, and G.L. Nemhauser,
Georgia Institute of Technology
- 4:00-4:25 The Family of Cuts Induced by a Disjunction
- Egon Balas, Carnegie Mellon University
- 4:30-4:55 Obtaining Tight Polyhedral Approximations of
Discrete Sets
- Warren P. Adams, Clemson University; Robin
Lougee-Heimer, IBM T.J. Watson Research Center; and Hanif D. Sherali,
Virginia Polytechnic Institute and State University
- 5:00-5:25 Facets of the Semi-Continuous Knapsack Polytope
- I. de Farias, IBM Corporation; E.L. Johnson, E.Lee, G.L.
Nemhauser and J.P. Richard, Georgia Institute of Technology
MMD, 3/15/99