| 1 | -- | 38 | Peter Richtárik, Martin Takác. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function |
| 39 | -- | 64 | Dinakar Gade, Simge Küçükyavuz, Suvrajeet Sen. Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs |
| 65 | -- | 91 | Marco Locatelli, Fabio Schoen. On convex envelopes for bivariate functions over polytopes |
| 93 | -- | 106 | Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint. On the complexity of finding first-order critical points in constrained nonlinear optimization |
| 107 | -- | 140 | Aida Khajavirad, Jeremy J. Michalek, Nikolaos V. Sahinidis. Relaxations of factorable functions with convex-transformable intermediates |
| 141 | -- | 179 | Chao Ding, Defeng Sun, Kim-Chuan Toh. An introduction to a class of matrix cone programming |
| 181 | -- | 226 | N. S. Aybat, Garud Iyengar. A unified approach for minimizing composite norms |
| 227 | -- | 245 | Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie. The traveling salesman problem on cubic and subcubic graphs |
| 247 | -- | 264 | Alejandro Toriello. Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem |
| 265 | -- | 276 | Jean B. Lasserre. New approximations for the cone of copositive matrices and its dual |
| 277 | -- | 305 | Gui-Hua Lin, Mengwei Xu, Jane J. Ye. On solving simple bilevel programs with a nonconvex lower level program |
| 307 | -- | 314 | Michele Conforti, Alberto Del Pia. Disjunctive programming and relaxations of polyhedra |
| 315 | -- | 346 | Timo Berthold, Ambros M. Gleixner. Undercover: a primal MINLP heuristic exploring a largest sub-MIP |
| 347 | -- | 368 | Denis Cornaz, Philippe Meurdesoif. Chromatic Gallai identities operating on Lovász number |
| 369 | -- | 412 | Francisco Facchinei, Christian Kanzow, Simone Sagratella. Solving quasi-variational inequalities via their KKT conditions |