IBM Watson Research Center, Yorktown Heights, NY

**Organizers:****William Cook**, Rice University, bico@caam.rice.edu**William Pulleyblank**, IBM Watson Research Center, pblk@us.ibm.com

Monday, August 2, 19998:30 - 8:55 Coffee will be served 8:55 - 9:00 Welcome and Greeting: William Pulleyblank, IBM Watson Research Center Fred S. Roberts, Rutgers University Morning 9:00 - 12:30 9:00 - 10:00 Vasek Chvatal, Rutgers University Gomory Cuts and Combinatorial Reasoning 10:00 - 10:30 Michael Juenger, Universitat zu Koeln ABACUS - A Branch And Cut System Break 11:00 - 11:30 Gerd Reinelt, Universitat Heidelberg Small Polytopes and Branch & Cut 11:30 - 12:00 Andras Sebo, CNRS, Leibniz-IMAG On empty lattice-simplices 12:00 - 12:30 Sebastian Ceria, Columbia University Gomory cuts revisited Afternoon 2:00 - 6:00 2:00 - 3:00 Herbert E. Scarf, Yale University. Homotopy methods for computing test sets 3:00 - 3:30 Karen Aardal, Utrecht University Integer relaxations and basis reduction 3:30 - 4:00 Imre Barany, Hungarian Academy of Sciences On the power of linear dependences Break 4:30 - 5:00 Bernd Sturmfels, University of California at Berkeley Commutative Algebra and Integer Programming 5:00 - 5:30 Robert Weismantel, University of Magdeburg Hilbert bases in Integer Programming 5:30 - 6:00 Gunter Ziegler, Technische Universitat Berlin Many `facets of complexity' of 0/1-polytopes and 0/1-programs 7:00 Conference Dinner: Tarrytown HiltonTuesday, August 3, 19998:30 - 9:00 Coffee will be served Morning 9:00 - 12:30 9:00 - 10:00 Egon Balas, Carnegie Mellon University Disjunctive programming revisited 10:00 - 10:30 Robert Bixby, Rice University MIP: Closing the gap between theory and practice Break 11:00 - 11:30 Bruce Shepherd, Lucent Bell Laboratories Stable Set Polytopes and Rank One Constraints 11:30 - 12:00 John Forrest, IBM Watson Research Center Using a Parallel Branch Cut and Column Generation framework to solve some difficult MIPLIB problems 12:00 - 12:30 Martin Savelsbergh, Georgia Institute of Technology Gomory cuts and commercial software Afternoon 2:00 - 6:00 2:00 - 3:00 George L. Nemhauser, Georgia Tech Large-scale Integer Programming in Airline Scheduling 3:00 - 3:30 Bernhard Korte, Unversity of Bonn Maximum mean weight cycle and cycle optimization of gigahertz processors 3:30 - 4:00 Thomas L. Magnanti, Massachusetts Institute of Technology Designing restorable telecommunication networks: a variant of Gomory-Hu network synthesis Break 4:30 - 5:00 Michael Trick, Carnegie Mellon University Adventures in sports scheduling 5:00 - 5:30 Leslie E. Trotter, Jr., Cornell University New Separation Procedures for Vehicle Routing 5:30 - 6:00 David Williamson, IBM Watson Research Laboratory Two-DImensional Gantt Charts and a Scheduling Algorithm of LawlerWednesday, August 4, 19998:30 - 9:00 Coffee will be served Morning 9:00 - 12:30 9:00 - 10:00 Gerard Cornuejols, Carnegie Mellon Unversity Balanced matrices 10:00 - 10:30 Francisco Barahona, IBM Watson Research Center On the volume algorithm and some combinatorial linear programs Break 11:00 - 11:30 Daniel Bienstock, Columbia University Approximately solving some large-scale linear programs 11:30 - 12:00 William H. Cunningham, University of Waterloo Optimal 3-terminal cuts and linear programming 12:00 - 12:30 T.C. Hu, University of California at San Diego Minimum Cuts in Networks Afternoon 2:00 - 6:00 2:00 - 3:00 Ralph Gomory, Sloan Foundation Corner Polyhedra and their Connection with Cutting Planes 3:00 - 3:30 Charles E. Blair, University of Illinois Finiteness proofs as of 1999 3:30 - 4:00 Michel X. Goemans, Universite Catholique de Louvain Linear Programming Relaxations Arising from Cooperative Game Theory Break 4:30 - 5:00 Peter Hammer, Rutgers University Boolean Optimization 5:00 - 5:30 Ellis Johnson, Georgia Institute of Technology Facets for Cycic Group Polyhedra and Knapsack Polytopes 5:30 - 6:00 Laurence Wolsey, Universite Catholique de Louvain Aggregation and Mixed Integer Rounding to solve MIPs

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage

Contacting the Center

Document last modified on July 27, 1999.