| 2021 | A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices. Yuni Iwamasa |
| 2021 | A Computational Status Update for Exact Rational Mixed Integer Programming. Leon Eifler, Ambros M. Gleixner |
| 2021 | A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows. Lukas Graf, Tobias Harks |
| 2021 | A New Integer Programming Formulation of the Graphical Traveling Salesman Problem. Robert D. Carr, Neil Simonetti |
| 2021 | A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh |
| 2021 | Affinely Representable Lattices, Stable Matchings, and Choice Functions. Yuri Faenza, Xuan Zhang |
| 2021 | Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. Siad Daboul, Stephan Held, Jens Vygen |
| 2021 | Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang |
| 2021 | Complexity, Exactness, and Rationality in Polynomial Optimization. Daniel Bienstock, Alberto Del Pia, Robert Hildebrand |
| 2021 | Computational Aspects of Relaxation Complexity. Gennadiy Averkov, Christopher Hojny, Matthias Schymura |
| 2021 | Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs. Matthias Walter |
| 2021 | Fast Quantum Subroutines for the Simplex Method. Giacomo Nannicini |
| 2021 | Fixed Parameter Approximation Scheme for Min-Max k-Cut. Karthekeyan Chandrasekaran, Weihang Wang |
| 2021 | Implications, Conflicts, and Reductions for Steiner Trees. Daniel Rehfeldt, Thorsten Koch |
| 2021 | Improving the Approximation Ratio for Capacitated Vehicle Routing. Jannis Blauth, Vera Traub, Jens Vygen |
| 2021 | Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings Mohit Singh, David P. Williamson |
| 2021 | Lifting Convex Inequalities for Bipartite Bilinear Programs. Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard |
| 2021 | Linear Regression with Mismatched Data: A Provably Optimal Local Search Algorithm. Rahul Mazumder, Haoyue Wang |
| 2021 | Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. Guyslain Naves, F. Bruce Shepherd, Henry Xia |
| 2021 | Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu |
| 2021 | New Exact Techniques Applied to a Class of Network Flow Formulations. Vinícius Loti de Lima, Manuel Iori, Flávio Keidi Miyazawa |
| 2021 | On the Geometry of Symmetry Breaking Inequalities. José Verschae, Matías Villagra, Léonard von Niederhäusern |
| 2021 | On the Implementation and Strengthening of Intersection Cuts for QCQPs. Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano |
| 2021 | On the Integrality Gap of Binary Integer Programs with Gaussian Data. Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari |
| 2021 | On the Power of Static Assignment Policies for Robust Facility Location Problems. Omar El Housni, Vineet Goyal, David B. Shmoys |
| 2021 | On the Recognition of a, b, c-Modular Matrices. Christoph Glanzer, Ingo Stallknecht, Robert Weismantel |
| 2021 | Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor |
| 2021 | Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems. Kazuki Matoya, Taihei Oki |
| 2021 | Proximity Bounds for Random Integer Programs. Marcel Celaya, Martin Henk |
| 2021 | Robust k-Center with Two Types of Radii. Deeparnab Chakrabarty, Maryam Negahbani |
| 2021 | Semi-streaming Algorithms for Submodular Matroid Intersection. Paritosh Garg, Linus Jordan, Ola Svensson |
| 2021 | Speed-Robust Scheduling - Sand, Bricks, and Rocks. Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon |
| 2021 | Sum-of-Squares Hierarchies for Binary Polynomial Optimization. Lucas Slot, Monique Laurent |
| 2021 | The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota |