Operations Research - Seminars and Visits
The OR PIC, in collaboration with the Reasoning PIC (formerly Artificial Intelligence PIC), which assumes cognitive aspects of OR, frequently hosts seminars and visits by academic scholars and top PhD students. Here is a list of some recent talks.
Year 2019
August 21, Nir Halman, Hebrew University of Jerusalem, Approximation Schemes for Non-Separable Non-Linear Boolean Programming Problems under Nested Knapsack Constraints
August 15, Rui Gao, University of Texas at Austin, Data-Driven Robust Optimization with Known Marginal Distributions
July 23, Mourad Baiou, University of Clermon-Ferrant, Network security games on networks and matroids
June 6, Dabeen Lee, Carnegie Mellon University, Chvatal-Gomory cuts, rank, closure, and their generalizations for integer programming
May 21, Andrew Goldberg, Cornell University, Beating the curse of dimensionality in options pricing and optimal stopping
May 15, Daniel Freund, Lyft, Fair Allocation of Passenger Premium Pay
May 9, Miles Lubin, Google, Polyhedral approaches for mixed-integer convex optimization
March 14, Paolo Paronuzzi, University of Bologna, New ILP formulations for k-Vertex Cut Problems
Year 2018
Dec 12, Martin Takac, Lehigh University, Reinforcement Learning for Solving the Vehicle Routing Problem
Nov 29, Huseyin Topaloglu, CornellTech, Approximation Algorithms for Network Revenue Management
Oct 20, Nam Ho-Nguyen, Carnegie Mellon University, A dynamic primal-dual first-order framework for convex optimization under uncertainty
Year 2017
Jun 14, Xiaoou Li, University of Minnesota, Optimal Sequential Designs for Crowdsourcing
May 11, Claudia Perlich, Dstillery, Machine Learning Challenges in Programmatic Advertising
Apr 24, Guodong Pang, Penn State University, New Maximal Inequalities and Non-Stationary Shot Noise Processes
Apr 6, Fatma Kilinc-Karzan, Carnegie Mellon University, Online First-Order Framework for Robust Convex Optimization
Mar 22, Amitabh Basu, Johns Hopkins University, Understanding Deep Neural Networks with Rectified Linear Units
Mar 16, Nicholas Gast, INRIA, Grenoble, France, How Accurate is Mean-Field Approximation?
Year 2016
Dec 9, Shane Henderson, Cornell University, Ranking and Selection: Strong Statistical Guarantees on 1000 Cores
Dec 7, David Yao, Columbia University, Production Planning with Risk Hedging
Dec 6, Giorgio Sartor, Singapore University of Technology and Design, A Matching Algorithm for Influence Maximization and Structural Controllability in Complex Networks
Nov 30, Guido Lagos, Georgia Tech, Limit distributions related to the Euler discretization error of Brownian motion about random times
Nov 7, Karthyek Murthy, Columbia University, Using data-driven DRO to optimally choose regularization parameter in machine learning
Nov 2, Mourad Baiou, CNRS-LIMOS Clermont-Ferrand, France, Network Disconnection Games
Oct 31, Yao Zhao, Dept. of Supply Chain Management, Rutgers University, Shipping Peak Demand for Online Sellers: Surcharge vs. Flat Rate
Oct 20, Guanghui (George) Lan, Georgia Institute of Technology, Optimal Stochastic Gradient Descent
Oct 12, Nathan Kallus, Cornell (NYC Tech Campus), Learning to Personalize from Observational and Behavioral Data
Oct 5, Alex Koppel, UPenn Wharton, Parsimonious Online Learning with Kernels via Sparse Projections in Function Space
Sept 27, Chang-han Rhee, CWI, Sample-Path Large Deviations for Heavy-Tails: the Principle of Multiple Big Jumps
Sept 22, Gustavo Vulcano, NYU Stern School of Business, A partial-order-based model to estimate individual preferences using panel data
May 13, Yanhua Li, Worcester Polytechnic Institute, Managing and Making Sense of Big Data From Urban Networks
May 4, Georgina Hall, Operations Research & Financial Engineering Dept, Princeton U, DC Decomposition of Nonconvex Polynomials with Algebraic Techniques
Mar 22, Santanu Dey, School of Industrial & Systems Engineering, Georgia Tech, Cutting planes to strengthen second order conic relaxation of the Optimal power flow problem
Mar 14, Gabor Pataki, Department of Statistics and Operations Research, UNC Chapel Hill, Combinatorial characterizations in semidefinite programming duality