Event Category: Operations Research Seminar Series

12/8/22 | 4:15pm | E51-145         Huseyin Topaloglu Howard and Eleanor Morgan Professor Cornell Abstract: In this talk, we give approximation algorithms for a joint inventory allocation and assortment personalization problem motivated by an online retail setting. In our problem, we have a limited amount of storage capacity that needs to be allocated…

12/1/22 | 4:15pm | E51-145         Max Shen Chancellor’s Professor Berkeley Abstract: Individuals interact in real-world to build relationships, share information, and create impacts. These interactions are abstracted by social networks. In this presentation, we cover a series of ongoing studies that integrate social network analysis into operations management. The main challenge…

11/17/22 | 4:15pm | E51-145         Mor Armony Harvey Golub Professor of Business Leadership NYU Stern School of Business Abstract: Contrary to traditional queueing theory, recent field studies in health care and call centers indicate that pooling queues may not lead to operational efficiencies relative to dedicated queues. We use a series…

11/10/22 | 4:15pm | E51-145         Peter Frazier Eleanor and Howard Morgan Professor Cornell University Abstract: Universities faced difficult decisions throughout the pandemic. Is it safe to hold classes in person? Should we require masks? What about vaccination? This mirrored tensions throughout society that pitted freedom against safety. At Cornell University, which…

11/3/22 | 4:15pm | E51-145         Sam Burer Tippie-Rollins Professor of Business Analytics University of Iowa Abstract: Copositive optimization is a tool for modeling (and approximating) difficult nonconvex problems using convex optimization. We survey and illustrate this research area using several vignettes on diverse topics such as mixed integer nonlinear programming, robust…

10/13/22 | 4:15pm | E51-145         Rachel Cummings Assistant Professor Columbia Abstract: Differential privacy (DP) is widely regarded as a gold standard for privacy-preserving computation over users’ data.  A key challenge with DP is that its mathematical sophistication makes its privacy guarantees difficult to communicate to users, leaving them uncertain about how…

10/6/22 | 4:15pm | E51-145         Christina Lee Yu Assistant Professor Cornell Abstract: In many domains, we are interested in estimating the total causal treatment effect in the presence of network interference, where the outcome of one individual or unit is affected by the treatment assignment of those in its local network. Additional challenges arise…

9/29/22 | 4:15pm | E51-145         Ernest Ryu Assistant Professor Seoul National University Abstract: Since the pioneering work of Nesterov on accelerated gradient methods, finding efficient and optimal first-order methods has been the focus in the study of large-scale optimization. Recently, renewed vitality was injected into this classical line of research by…

9/22/22 | 4:15pm | E51-145         Rene Caldentey Professor of Operations Management The University of Chicago Abstract: We study the interplay between information sharing and order smoothing in the context of a prototypical two-tier inventory management system with one retailer and one supplier. We contribute to this literature by adapting a novel…

9/15/22 | 4:15pm | E51-145         Santanu Dey Professor Georgia Tech Abstract: The branch-and-bound algorithm was invented for solving integer programs (IP) in 1960. Since then, there is very little theoretical analysis of the branch-and-bound algorithm, even though the algorithm is the workhorse of all modern IP solvers. We try and answer…