| 1 | -- | 3 | Leo Liberti, Sebastian Sager, Angelika Wiegele. Preface |
| 5 | -- | 55 | Mohit Tawarmalani. New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions |
| 57 | -- | 94 | Jan Kronqvist, Ruth Misener, Calvin Tsay. P-split formulations: a class of intermediate formulations between big-M and convex hull for disjunctive constraints |
| 95 | -- | 118 | Markus Gabl, Kurt M. Anstreicher. Solving nonconvex optimization problems using outer approximations of the set-copositive cone |
| 119 | -- | 168 | Lennart Sinjorgo, Renata Sotirov, Miguel F. Anjos. Cuts and semidefinite liftings for the complex cut polytope |
| 169 | -- | 211 | Antonio De Rosa, Aida Khajavirad. Explicit convex hull description of bivariate quadratic sets with indicator variables |
| 213 | -- | 243 | Christoph Buchheim, Maximilian Merkert. Extended formulations for control languages defined by finite-state automata |
| 245 | -- | 290 | Sven Leyffer, Paul Manns. McCormick envelopes in mixed-integer PDE-constrained optimization |
| 291 | -- | 336 | Aaresh Bhathena, Salar Fattahi, Andrés Gómez 0001, Simge Küçükyavuz. A parametric approach for solving convex quadratic optimization with indicators over trees |
| 337 | -- | 374 | Gabriel Ponte, Marcia Fampa, Jon Lee 0001. Branch-and-bound for integer D-optimality with fast local search and variable-bound tightening |
| 375 | -- | 401 | Peijing Liu, Alper Atamtürk, Andrés Gómez 0001, Simge Küçükyavuz. Polyhedral analysis of quadratic optimization problems with Stieltjes matrices and indicators |
| 403 | -- | 437 | Johannes Thürauf, Julia Grübel, Martin Schmidt 0003. Adjustable robust nonlinear network design without controllable elements under load scenario uncertainties |
| 439 | -- | 476 | Henri Lefebvre, Enrico Malaguti, Michele Monaci. Exact approaches for convex adjustable robust optimization |
| 477 | -- | 504 | Arne Heimendahl, Moritz Lücke, Frank Vallentin, Marc Christian Zimmermann. A semidefinite program for least distortion embeddings of flat tori into Hilbert spaces |
| 505 | -- | 561 | Daniel Brosch, Diane Puges. Getting to the root of the problem: sums of squares for limits of trees |
| 563 | -- | 589 | Bernd Mulansky, Andreas Potschka. A zonogon approach for computing small convex polygons of maximum perimeter |
| 591 | -- | 592 | Sven Leyffer, Paul Manns. Correction: McCormick envelopes in mixed-integer PDE-constrained optimization |
| 593 | -- | 596 | Bernd Mulansky, Andreas Potschka. Correction: A zonogon approach for computing small convex polygons of maximum perimeter |