| 1 | -- | 0 | . Preface |
| 3 | -- | 39 | Ross Anderson, Joey Huchette, Will Ma, Christian Tjandraatmadja, Juan Pablo Vielma. Strong mixed-integer programming formulations for trained neural networks |
| 41 | -- | 59 | Manuel Aprile, Yuri Faenza. Extended formulations from communication protocols in output-efficient time |
| 61 | -- | 103 | Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner. Symmetry-breaking inequalities for ILP with structured sub-symmetry |
| 105 | -- | 148 | Daniel Bienstock, Chen Chen 0026, Gonzalo Muñoz. Outer-product-free sets for polynomial optimization and oracle-based cuts |
| 149 | -- | 169 | Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg 0003. Online submodular maximization: beating 1/2 made simple |
| 171 | -- | 193 | Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan. Improving the integrality gap for multiway cut |
| 195 | -- | 214 | Chandra Chekuri, Kent Quanrud, Manuel R. Torres. 1-Sparsity approximation bounds for packing integer programs |
| 215 | -- | 247 | Lin Chen 0009, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein 0001. A general framework for handling commitment in online throughput maximization |
| 249 | -- | 281 | Federico Della Croce, Rosario Scatamacchia. An exact approach for the bilevel knapsack problem with interdiction constraints and extensions |
| 283 | -- | 308 | Elisabeth Gaar, Franz Rendl. A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring |
| 309 | -- | 335 | Lukas Graf, Tobias Harks, Leon Sering. Dynamic flows with adaptive route choice |
| 337 | -- | 358 | Christoph Hunkenschröder, Gina Reuland, Matthias Schymura. On compact representations of Voronoi cells of lattices |
| 359 | -- | 377 | Zhuan Khye Koh, Laura Sanità. An efficient characterization of submodular spanning tree games |
| 379 | -- | 395 | Anna Köhne, Vera Traub, Jens Vygen. The asymmetric traveling salesman path LP has constant integrality ratio |
| 397 | -- | 418 | André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen. Approximate multi-matroid intersection via iterative refinement |
| 419 | -- | 453 | Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi, Roberto Wolfler Calvo. An exact algorithm for robust influence maximization |
| 455 | -- | 481 | Martin Nägele, Rico Zenklusen. A new contraction technique with applications to congruency-constrained cuts |
| 483 | -- | 523 | Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck. A generic exact solver for vehicle routing and related problems |
| 525 | -- | 554 | Ambros M. Gleixner, Daniel E. Steffy. Linear programming using limited-precision oracles |
| 555 | -- | 581 | Jochen Könemann, Kanstantsin Pashkovich, Justin Toth. Computing the nucleolus of weighted cooperative matching games in polynomial time |
| 583 | -- | 618 | Victor Verdugo, José Verschae, Andreas Wiese. Breaking symmetries to rescue sum of squares in the case of makespan scheduling |
| 619 | -- | 647 | Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Ky Khac Vu. Random projections for quadratic programs |