IP and AP for Lunch
Wednesday, Noon - 1pm
01/19/05: IP and AP for Lunch, David Gamarnik and Maxim Sviridenko, SODA 2005 Special. (Room 20-059)
1) Expectation of the random minimal length spanning tree of a complete graph, by David Gamarnik.
2) Jobshop scheduling with unit processing times, by Nikhil Bansal, Tracy Kimbrel and Maxim Sviridenko.
02/09/05: IP for Lunch, Jiawei Zhang, Title TBD. (Room 20-059)
02/16/05: IP for Lunch, Tracy Kimbrel, "Dynamic application placement under service and memory constraints". (Room 20-059)
02/23/05: AP for Lunch, Bonnie Ray, "Online change-point detection methods for time series". (Room 20-059)
03/02/05: AP for Lunch, Ana Radovanovic, Title TBD. (Room 20-059)
03/09/05: IP for Lunch, David Phillips, Columbia University, Title TBD. (Room 20-059)
03/16/05: IP for Lunch, Nikhil Bansal, "Approximation Algorithms for broadcast scheduling". (Room 20-059)
03/30/05: IP for Lunch, Jon Lee, Title TBD. (Room 20-059)
04/06/05: IP for Lunch, Francisco Barahona, "Increasing the weight of all minimum spanning trees, an LP approach". (Room 20-059)
04/13/05: IP for Lunch, Maxim Sviridenko, "Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems". (Room 20-059)
04/20/05: IP for Lunch, Adrian Zymolka, Zuse Institut Berlin, "Wavelength Assignment in WDM Networks by Integer Programming". (Room 20-059)
04/27/05: AP for Lunch, Bonnie Ray, "Online change-point detection methods for time series". (Room 20-059)
05/04/05: IP for Lunch, Jon Lee, "In Situ Column Generation for a Cutting-Stock Problem". (Room 20-059)
"IP and AP for Lunch" is held at the IBM T.J. Watson Research Center, Yorktown. For directions, see the IBM Watson homepage.
2004 Lunch Series
2003 Lunch Series
