IPCO 2021 Accepted Papers

Giacomo Nannicini. Fast quantum subroutines for the simplex method
Kazuki Matoya and Taihei Oki. Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior and Bertrand Simon. Speed-Robust Scheduling
Siad Daboul, Stephan Held and Jens Vygen. Approximating the discrete time-cost tradeoff problem with bounded depth
Klaus Jansen, Kim-Manuel Klein and Alexandra Lassota. The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs
Vinícius Loti de Lima, Manuel Iori and Flávio Keidi Miyazawa. New Exact Techniques Applied to a Class of Network Flow Formulations
Christoph Glanzer, Ingo Stallknecht and Robert Weismantel. On the recognition of {a,b,c}-modular matrices
Lucas Slot and Monique Laurent. Sum-of-squares hierarchies for binary polynomial optimization
Robert Carr and Neil Simonetti. A New Integer Programming Formulation of the Graphical Traveling Salesman Problem
Maryam Negahbani and Deeparnab Chakrabarty. Robust k-Center with Two Types of Radii
Yuni Iwamasa. A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices
Jannis Blauth, Vera Traub and Jens Vygen. Improving the Approximation Ratio for Capacitated Vehicle Routing
Manuel Aprile, Matthew Drescher, Samuel Fiorini and Tony Huynh. A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem
Lukas Graf and Tobias Harks. A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows
Niv Buchbinder, Christian Coester and Seffi Naor. Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual
Amitabh Basu, Michele Conforti, Marco Di Summa and Hongyi Jiang. Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II
Omar El Housni, Vineet Goyal and David Shmoys. On the Power of Static Assignment Policies for Robust Facility Location Problems
Gennadiy Averkov, Christopher Hojny and Matthias Schymura. Computational Aspects of Relaxation Complexity
Paritosh Garg, Linus Jordan and Ola Svensson. Semi-Streaming Algorithms for Submodular Matroid Intersection
Matthias Walter. Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs
Karthekeyan Chandrasekaran and Weihang Wang. Fixed Parameter Approximation Scheme for Min-max k-cut
Leon Eifler and Ambros Gleixner. A Computational Status Update for Exact Rational Mixed Integer Programming
José Verschae, Matías Villagra and Léonard von Niederhäusern. On the Geometry of Symmetry Breaking Inequalities
Daniel Dadush, Sander Borst, Sophie Huiberts and Samarth Tiwari. On the Integrality Gap of Binary Integer Programs with Gaussian Data
Bruce Shepherd, Guyslain Naves and Henry Xia. Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators
Xiaoyi Gu, Santanu Dey and Jean-Philippe Richard. Lifting Convex Inequalities for Bipartite Bilinear Programs
Yuri Faenza and Xuan Zhang. Affinely representable lattices, stable matchings, and choice functions
Robert Hildebrand, Alberto Del Pia and Daniel Bienstock. Complexity, Exactness, and Rationality in Polynomial Optimization
Marcel Celaya and Martin Henk. Proximity bounds for random integer programs
Rahul Mazumder and Haoyue Wang. Linear Regression with Mismatched Data:a Provably Optimal Local Search Algorithm
Daniel Rehfeldt and Thorsten Koch. Implications, conflicts, and reductions for Steiner trees
Alberto Del Pia, Jeff Linderoth and Haoran Zhu. Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets
Antonia Chmiela, Gonzalo Muñoz and Felipe Serrano. On the implementation and strengthening of intersection cuts for QCQPs