| 1 | -- | 20 | Steffen Borgwardt. On the diameter of partition polytopes and vertex-disjoint cycle cover |
| 21 | -- | 48 | Angel Corberán, Isaac Plana, Antonio M. Rodríguez-Chía, José M. Sanchis. A branch-and-cut algorithm for the maximum benefit Chinese postman problem |
| 49 | -- | 101 | Stephen M. Robinson. Equations on monotone graphs |
| 103 | -- | 120 | Shashi Mittal, Andreas S. Schulz. An FPTAS for optimizing a class of low-rank functions over a polytope |
| 121 | -- | 133 | Arnaud Pêcher, Annegret Katrin Wagler. Computing clique and chromatic number of circular-perfect graphs in polynomial time |
| 135 | -- | 163 | Adrian S. Lewis, Michael L. Overton. Nonsmooth optimization via quasi-Newton methods |
| 165 | -- | 192 | Monia Giandomenico, Fabrizio Rossi, Stefano Smriglio. Strong lift-and-project cutting planes for the stable set problem |
| 193 | -- | 215 | Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik. Computing pure Nash and strong equilibria in bottleneck congestion games |
| 217 | -- | 255 | Ming Zhao, Ismael Regis de Farias Jr.. The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints |
| 257 | -- | 271 | Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin. Testing additive integrality gaps |
| 273 | -- | 293 | Xin Chen, Jiming Peng, Shuzhong Zhang. Sparse solutions to random standard quadratic optimization problems |
| 295 | -- | 317 | Wei Hong Yang, Xiaoming Yuan. The GUS-property of second-order cone linear complementarity problems |
| 319 | -- | 348 | Jonathan Eckstein, Paulo J. S. Silva. A practical relative error criterion for augmented Lagrangians |
| 349 | -- | 382 | Donald Goldfarb, Shiqian Ma, Katya Scheinberg. Fast alternating linearization methods for minimizing the sum of two convex functions |
| 383 | -- | 403 | Benedict Geihe, Martin Lenz, Martin Rumpf, Rüdiger Schultz. Risk averse elastic shape optimization with parametrized fine scale geometry |
| 405 | -- | 433 | Dominik Skanda, Dirk Lebiedz. A robust optimization approach to experimental design for model discrimination of dynamical systems |
| 435 | -- | 452 | Christoph Buchheim, Angelika Wiegele. Semidefinite relaxations for non-convex quadratic mixed-integer programming |
| 453 | -- | 477 | André R. S. Amaral, Adam N. Letchford. A polyhedral approach to the single row facility layout problem |
| 479 | -- | 506 | Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis. On generalizations of network design problems with degree bounds |
| 507 | -- | 526 | Santanu S. Dey, Diego A. Morán R.. Some properties of convex hulls of integer points contained in general convex sets |
| 527 | -- | 547 | Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain. A 3-approximation algorithm for the facility location problem with uniform capacities |
| 549 | -- | 559 | Thành Nguyen. A simple LP relaxation for the asymmetric traveling salesman problem |
| 561 | -- | 576 | Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli. Unique lifting of integer variables in minimal inequalities |
| 577 | -- | 589 | Emmanuel J. Candès, Benjamin Recht. Simple bounds for recovering low-complexity models |
| 591 | -- | 599 | Sanjeeb Dash, Oktay Günlük. On t-branch split cuts for mixed-integer programs |
| 601 | -- | 602 | Maarten H. van der Vlerk. Erratum to: Convex approximations for complete integer recourse models |