| 1 | -- | 18 | Raymond Hemmecke, Matthias Köppe, Robert Weismantel. Graver basis and proximity techniques for block-structured separable convex integer minimization problems |
| 19 | -- | 58 | Amitabh Basu, Robert Hildebrand, Matthias Köppe. The triangle closure is a polyhedron |
| 59 | -- | 96 | Francisco Facchinei, Jong-Shi Pang, Gesualdo Scutari, Lorenzo Lampariello. VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks |
| 97 | -- | 131 | Zhou Wei, Jen-Chih Yao, Xi Yin Zheng. Strong Abadie CQ, ACQ, calmness and linear regularity |
| 133 | -- | 161 | Antonio Frangioni, Enrico Gorgone. Bundle methods for sum-functions with "easy" components: applications to multicommodity network design |
| 163 | -- | 177 | Kazuo Murota, Akiyoshi Shioura. Dijkstra's algorithm and L-concave function maximization |
| 179 | -- | 198 | William W. Hager, James T. Hungerford. Optimality conditions for maximizing a function over a polyhedron |
| 199 | -- | 222 | Santanu S. Dey, Sebastian Pokutta. Design and verify: a new scheme for generating cutting-planes |
| 223 | -- | 261 | Philipp W. Keller, Retsef Levi, Georgia Perakis. Efficient formulations for pricing under attraction demand models |
| 263 | -- | 290 | Fabián Flores Bazán, Gabriel Cárcamo. A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints |
| 291 | -- | 325 | Monique Laurent, Antonios Varvitsiotis. A new graph parameter related to bounded rank positive semidefinite matrix completions |
| 327 | -- | 348 | Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma. On the Chvátal-Gomory closure of a compact convex set |
| 349 | -- | 376 | Kelly M. Sullivan, J. Cole Smith, David P. Morton. Convex hull representation of the deterministic bipartite network interdiction problem |
| 377 | -- | 401 | Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan. Preemptive and non-preemptive generalized min sum set cover |
| 403 | -- | 450 | Kwanghun Chung, Jean-Philippe P. Richard, Mohit Tawarmalani. Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets |
| 451 | -- | 482 | Yoel Drori, Marc Teboulle. Performance of first-order methods for smooth convex minimization: a novel approach |
| 483 | -- | 508 | Sanjeeb Dash, Neil B. Dobbs, Oktay Günlük, Tomasz Nowicki, Grzegorz Swirszcz. Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming |
| 509 | -- | 529 | Herbert Hamers, Silvia Miquel, Henk Norde. Monotonic stable solutions for minimum coloring games |
| 531 | -- | 563 | M. Kanat Camlibel, Luigi Iannelli, Francesco Vasca. Passivity and complementarity |
| 565 | -- | 599 | Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey. Semi-continuous network flow problems |
| 601 | -- | 604 | Andrzej Ruszczynski. Erratum to: Risk-averse dynamic programming for Markov decision processes |