| 2023 | A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. | Eranda ela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf |
| 2023 | Inapproximability of Shortest Paths on Perfect Matching Polytopes. | Jean Cardinal, Raphael Steiner |
| 2023 | Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. | Christina Bsing, Timo Gersing, Arie M. C. A. Koster |
| 2023 | Sparse Approximation over the Cube. | Sabrina Bruckmeier, Christoph Hunkenschrder, Robert Weismantel |
| 2023 | A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. | Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev |
| 2023 | Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. | Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg |
| 2023 | Information Complexity of Mixed-Integer Convex Optimization. | Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro |
| 2022 | Approximate $\mathrm {CVP}_{}$ in Time 2 | Thomas Rothvoss, Moritz Venzin |
| 2022 | Simple Odd β-Cycle Inequalities for Binary Polynomial Optimization. | Alberto Del Pia, Matthias Walter |
| 2022 | On the Complexity of Separation from the Knapsack Polytope. | Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu |
| 2022 | The Secretary Problem with Distributions. | Pranav Nuti |
| 2022 | The Limits of Local Search for Weighted k-Set Packing. | Meike Neuwohner |
| 2022 | A Competitive Algorithm for Throughput Maximization on Identical Machines. | Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou |
| 2022 | Graph Coloring and Semidefinite Rank. | Renee Mirka, Devin Smedira, David P. Williamson |
| 2022 | Lattice-Free Simplices with Lattice Width 2d - o(d). | Lukas Mayrhofer, Jamico Schade, Stefan Weltge |
| 2022 | A PTAS for the Horizontal Rectangle Stabbing Problem. | Arindam Khan, Aditya Subramanian, Andreas Wiese |
| 2022 | Neural Networks with Linear Threshold Activations: Structure and Algorithms. | Sammy Khalife, Amitabh Basu |
| 2022 | An Abstract Model for Branch-and-Cut. | Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan |
| 2022 | LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization. | Omar El Housni, Ayoub Foussoul, Vineet Goyal |
| 2022 | The Two-Stripe Symmetric Circulant TSP is in P. | Samuel C. Gutekunst, Billy Jin, David P. Williamson |
| 2022 | Matroid-Based TSP Rounding for Half-Integral Solutions. | Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar |
| 2022 | On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs. | Max Glser, Marc E. Pfetsch |
| 2022 | Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. | Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan |
| 2022 | SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. | Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kbra Taninmis |
| 2022 | Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. | Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour |