Program – Wednesday, May 19th Time EDT Presentation 9:15 – 9:30am Opening Remarks and Breakfast Session chair: David Williamson 9:30 – 10:00am Blauth, Traub, Vygen. Improving the Approximation Ratio for Capacitated Vehicle Routing Short Video Presentation Video 10:00 – 10:30am Buchbinder, Coester, Naor. Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual Short Video Presentation Video 10:30 – 11:00am Daboul, Held, Vygen. Approximating the discrete time-cost tradeoff problem with bounded depth Short Video Presentation Video 11:00 – 11:15am Coffee Break Session chair: Oktay Gunlunk 11:15 – 11:45am Chmiela, Muñoz, Serrano. On the implementation and strengthening of intersection cuts for QCQPsShort Video Presentation Video 11:45 – 12:15pm Gu, Dey, Richard. Lifting Convex Inequalities for Bipartite Bilinear Programs Short Video Presentation Video 12:15 – 12-30pm Remarks by PC chair 12:30 – 1:30pm Senior-Junior lunch Session chair: Jesús A. De Loera 1:30 – 2:00pm Slot, Laurent. Sum-of-squares hierarchies for binary polynomial optimization Short Video Presentation Video 2:00 – 2:30pm Hildebrand, Del Pia, Bienstock. Complexity, Exactness, and Rationality in Polynomial Optimization Short Video Presentation Video 2:30 – 3:00pm Verschae, Villagra, von Niederhäusern. On the Geometry of Symmetry Breaking Inequalities Short Video Presentation Video 3:00 – 3:15pm Coffee Break Session chair: Britta Peis 3:15 – 3:45pm Faenza, Zhang. Affinely representable lattices, stable matchings, and choice functions Short Video Presentation Video 3:45 – 4:15pm Graf, Harks. A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows Short Video Presentation Video 4:15 – 4:45pm Iwamasa. A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2 X 2 submatrices Short Video Presentation Video 4:45 – 5:30pm Poster Session 1
