Fast quantum subroutines for the simplex method

Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems

Speed-Robust Scheduling

Approximating the discrete time-cost tradeoff problem with bounded depth

The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs

New Exact Techniques Applied to a Class of Network Flow Formulations

On the recognition of {a,b,c}-modular matrices

Sum-of-squares hierarchies for binary polynomial optimization

A New Integer Programming Formulation of the Graphical Traveling Salesman Problem

Robust k-Center with Two Types of Radii

A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices

Improving the Approximation Ratio for Capacitated Vehicle Routing

A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem

A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows

Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual

Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II

On the Power of Static Assignment Policies for Robust Facility Location Problems

Computational Aspects of Relaxation Complexity

Semi-Streaming Algorithms for Submodular Matroid Intersection

Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs

Fixed Parameter Approximation Scheme for Min-max k-cut

A Computational Status Update for Exact Rational Mixed Integer Programming

On the Geometry of Symmetry Breaking Inequalities

On the Integrality Gap of Binary Integer Programs with Gaussian Data

Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators

Lifting Convex Inequalities for Bipartite Bilinear Programs

Affinely representable lattices, stable matchings, and choice functions

Complexity, Exactness, and Rationality in Polynomial Optimization

Proximity bounds for random integer programs

Linear Regression with Mismatched Data:a Provably Optimal Local Search Algorithm

Implications, conflicts, and reductions for Steiner trees

Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets

On the implementation and strengthening of intersection cuts for QCQPs