Program – Friday, May 21st

Time EDT Presentation
9:15 – 9:30am Breakfast
Session chair: Satoru Iwata
9:30 – 10:00am Shepherd, Naves, Xia. Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators
Short Video Presentation Video
10:00 – 10:30am Aprile, Drescher, Fiorini, Huynh. A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem
Short Video Presentation Video
10:30 – 11:00am Chandrasekaran, Wang. Fixed Parameter Approximation Scheme for Min-max k-cut
Short Video Presentation Video
11:00 – 11:15am Coffee Break
Session chair: Andrea Lodi
11:15 – 11:45am Jansen, Klein, Lassota. The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs
Short Video Presentation Video
11:45 – 12:15pm Nannicini. Fast quantum subroutines for the simplex method
Short Video Presentation Video
12:30 – 1:30pm Senior-Junior lunch
Session chair: Sanjeeb Dash
1:30 – 2:00pm Averkov, Hojny, Schymura. Computational Aspects of Relaxation Complexity
Short Video Presentation Video
2:00 – 2:30pm Basu, Conforti, Di Summa, Jiang. Complexity of branch-and-bound and cutting planes in mixed-integer optimization – II
Short Video Presentation Video
2:30 – 3:00pm Walter. Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs
Short Video Presentation Video
3:00 – 3:15pm Coffee Break
Session chair: Jim Luedtke
3:15 – 3:45pm Celaya, Henk. Proximity bounds for random integer programs
Short Video Presentation Video
3:45 – 4:15pm Dadush, Borst, Huiberts, Tiwari. On the Integrality Gap of Binary Integer Programs with Gaussian Data
Short Video Presentation Video
4:15 – 4:45pm Mazumder, Wang. Linear Regression with Mismatched Data:a Provably Optimal Local Search Algorithm
Short Video Presentation Video
4:45 – 5:30pm Social