Conference Schedule & Recordings

All times are UK summer time (BST).

Clicking on the title of a talk will open the corresponding paper in a new tab. Links to the videos of the talks are also provided.

Monday June 8

8:50	Opening remarks by the local chair (Giacomo Zambelli)
	Session chair: Tamás Király
9:00	A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2x2 Submatrices (video) Hiroshi Hirai, Yuni Iwamasa
9:30	Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (video) Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
10:00	Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-Connectivity (video) David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
10:30	Coffee break
	Session chair: Britta Peis
11:00	Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (video) Naveen Garg, Nikhil Kumar, András Sebő
11:30	Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds (video) Sarah Morell, Martin Skutella
12:00	Algorithms for Flows over Time with Scheduling Costs (video) Dario Frascaria, Neil Olver
12:30	Lunch break
13:50	Remarks by the PC chair (Dan Bienstock)
	Session chair: Dan Bienstock
14:00	About the Complexity of Two-Stage Stochastic IPs (video) Kim-Manuel Klein
14:30	The Integrality Number of an Integer Program (video) Joseph Paat, Miriam Schlöter, Robert Weismantel
15:00	Sequence Independent Lifting for the Set of Submodular Maximization Problems (video) Xueyu Shi, Oleg A. Prokopyev, Bo Zeng
15:30	Coffee break
	Session chair: Michele Conforti
16:00	Recognizing Even-Cycle and Even-Cut Matroids (video) Cheolwon Heo, Bertrand Guenin
16:30	Idealness of k-wise Intersecting Families (video) Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
17:15	Social hour

Tuesday June 9

	Session chair: Karen Aardal
9:00	On a Generalization of the Chvátal-Gomory Closure (video) Sanjeeb Dash, Oktay Günlük, Dabeen Lee
9:30	Constructing Lattice-Free Gradient Polyhedra in Dimension Two (video) Joseph Paat, Miriam Schlöter, Emily Speakman
10:00	Optimizing Sparsity over Lattices and Semigroups (video) Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel
10:30	Coffee break
	Session chair: Laura Sanità
11:00	Tight Approximation Bounds for Maximum Multi-Coverage (video) Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpınar
11:30	Improved Approximation Algorithms for Inventory Problems (video) Thomas Bosman, Neil Olver
12:00	A Technique for Obtaining True Approximations for k-Center with Covering Constraints (video) Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
	Fair Colorful k-Center Clustering (video) Xinrui Jia, Kshiteej Sheth, Ola Svensson
12:30	Lunch break
	Session chair: Jeff Linderoth
14:00	On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (video) Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros Gleixner, Andrea Lodi, Felipe Serrano
14:30	Implementing Automatic Benders Decomposition in a Modern MIP Solver (video) Pierre Bonami, Domenico Salvagnin, Andrea Tramontani
15:00	Graph Coloring Lower Bounds from Decision Diagrams (video) Willem-Jan van Hoeve
15:30	Coffee break
	Session chair: Jochen Koenemann
16:00	Continuous Facility Location on Graphs (video) Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
16:30	Stochastic Makespan Minimization in Structured Set Systems (video) Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
17:15	Social hour

Wednesday June 10

	Session chair: András Sebő
9:00	Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles (video) Yusuke Kobayashi
9:30	Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles (video) Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
10:00	Persistency of Linear Programming Relaxations for the Stable Set Problem (video) Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge
10:30	Coffee break
	Session chair: TBA
11:00	Sparse Graphs and an Augmentation Problem (video) Csaba Király, András Mihálykó
11:30	Popular Branchings and Their Dual Certificates (video) Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
12:00	Lunch break
	Session chair: Jon Lee
14:00	Maximal Quadratic-Free Sets (video) Gonzalo Muñoz, Felipe Serrano
14:30	On Convex Hulls of Epigraphs of QCQPs (video) Alex L. Wang, Fatma Kılınç-Karzan
15:00	On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (video) Linchuan Wei, Andrés Gómez, Simge Küçükyavuz
15:30	Coffee break
	Session chair: Jens Vygen
16:00	Packing under Convex Quadratic Constraints (video) Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella
16:30	A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering (video) Vera Traub, Thorben Alexander Tröbst
17:15	Social hour

$LSE Math logo$