Abstract is missing.
- Improving the Approximation Ratio for Capacitated Vehicle RoutingJannis Blauth, Vera Traub, Jens Vygen. 1-14 [doi]
- Online k-Taxi via Double Coverage and Time-Reverse Primal-DualNiv Buchbinder, Christian Coester, Joseph (Seffi) Naor. 15-29 [doi]
- Approximating the Discrete Time-Cost Tradeoff Problem with Bounded DepthSiad Daboul, Stephan Held, Jens Vygen. 30-42 [doi]
- Sum-of-Squares Hierarchies for Binary Polynomial OptimizationLucas Slot, Monique Laurent. 43-57 [doi]
- Complexity, Exactness, and Rationality in Polynomial OptimizationDaniel Bienstock, Alberto Del Pia, Robert Hildebrand. 58-72 [doi]
- On the Geometry of Symmetry Breaking InequalitiesJosé Verschae, Matías Villagra, Léonard von Niederhäusern. 73-88 [doi]
- Affinely Representable Lattices, Stable Matchings, and Choice FunctionsYuri Faenza, Xuan Zhang. 89-103 [doi]
- A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium FlowsLukas Graf, Tobias Harks. 104-118 [doi]
- A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ SubmatricesYuni Iwamasa. 119-133 [doi]
- On the Implementation and Strengthening of Intersection Cuts for QCQPsAntonia Chmiela, Gonzalo Muñoz, Felipe Serrano. 134-147 [doi]
- Lifting Convex Inequalities for Bipartite Bilinear ProgramsXiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard. 148-162 [doi]
- A Computational Status Update for Exact Rational Mixed Integer ProgrammingLeon Eifler, Ambros M. Gleixner. 163-177 [doi]
- New Exact Techniques Applied to a Class of Network Flow FormulationsVinícius Loti de Lima, Manuel Iori, Flávio Keidi Miyazawa. 178-192 [doi]
- Multi-cover Inequalities for Totally-Ordered Multiple Knapsack SetsAlberto Del Pia, Jeff Linderoth, Haoran Zhu. 193-207 [doi]
- Semi-streaming Algorithms for Submodular Matroid IntersectionParitosh Garg, Linus Jordan, Ola Svensson. 208-222 [doi]
- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity ProblemsKazuki Matoya, Taihei Oki. 223-237 [doi]
- On the Recognition of a, b, c-Modular MatricesChristoph Glanzer, Ingo Stallknecht, Robert Weismantel. 238-251 [doi]
- On the Power of Static Assignment Policies for Robust Facility Location ProblemsOmar El Housni, Vineet Goyal, David Shmoys. 252-267 [doi]
- Robust k-Center with Two Types of RadiiDeeparnab Chakrabarty, Maryam Negahbani. 268-282 [doi]
- Speed-Robust Scheduling - Sand, Bricks, and RocksFranziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon. 283-296 [doi]
- The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPsKlaus Jansen, Kim-Manuel Klein, Alexandra Lassota. 297-310 [doi]
- Fast Quantum Subroutines for the Simplex MethodGiacomo Nannicini. 311-325 [doi]
- Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut ApproximatorsGuyslain Naves, F. Bruce Shepherd, Henry Xia. 326-339 [doi]
- A Tight Approximation Algorithm for the Cluster Vertex Deletion ProblemManuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh. 340-353 [doi]
- Fixed Parameter Approximation Scheme for Min-Max k-CutKarthekeyan Chandrasekaran, Weihang Wang. 354-367 [doi]
- Computational Aspects of Relaxation ComplexityGennadiy Averkov, Christopher Hojny, Matthias Schymura. 368-382 [doi]
- Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - IIAmitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang. 383-398 [doi]
- Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear ProgramsMatthias Walter. 399-412 [doi]
- Proximity Bounds for Random Integer ProgramsMarcel Celaya, Martin Henk. 413-426 [doi]
- On the Integrality Gap of Binary Integer Programs with Gaussian DataSander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari. 427-442 [doi]
- Linear Regression with Mismatched Data: A Provably Optimal Local Search AlgorithmRahul Mazumder, Haoyue Wang. 443-457 [doi]
- A New Integer Programming Formulation of the Graphical Traveling Salesman ProblemRobert D. Carr, Neil Simonetti. 458-472 [doi]
- Implications, Conflicts, and Reductions for Steiner TreesDaniel Rehfeldt, Thorsten Koch. 473-487 [doi]