
| Msg # 85 of 1212 on ZZNY4444, Thursday 9-28-22, 3:54 |
| From: CLIFF@IEOR.COLUMBIA.EDU |
| To: ALL |
| Subj: Columbia Optimization Day |
XPost: cs.bboard, columbia.general.bboard 3rd Columbia Optimization Day Monday, November 3, 2003 9:00 AM, Schermerhorn 501 PROGRAM 9:00: Opening Remarks - Donald Goldfarb IEOR Department, Columbia University 9:15 - 10:00: Egon Balas, Carnegie Mellon University The Vertex Separator Problem 10:10 - 10:55: Ravi Kannan, Yale University Sampling on the fly from massive data 11:05 - 11:50: David Applegate, AT&T Research Optimization of Demand Oblivious Routing Lunch 2:00 - 2:35: Baruch Schieber, IBM Research Approximating the Throughput in Resource Allocation and Real Time Scheduling 2:55 - 3:40: James Orlin, MIT The Complexity of Inverse and Partial Inverse Optimization Problems Coffee Break 4:00 - 4:45: Arkadi Nemirovski, Israel Institute of Technology A simple $O(1/t)$-converging method for extremely large-scale convex-concave games and eigenvalue optimization Please visit www.corc.ieor.columbia.edu/meetings/c3/c3.html for registration and location details. See you all there! --- SoupGate-Win32 v1.05 * Origin: you cannot sedate... all the things you hate (1:229/2) |
328,091 visits
(c) 1994, bbs@darkrealms.ca