| 369 | -- | 370 | Nguyen V. Thoai, Harold P. Benson, Panos M. Pardalos. Preface |
| 371 | -- | 390 | Takahito Kuno, Paul E. K. Buckland. A convergent simplicial algorithm with ω-subdivision and ω-bisection strategies |
| 391 | -- | 409 | Aida Khajavirad, Nikolaos V. Sahinidis. Convex envelopes of products of convex and component-wise concave functions |
| 411 | -- | 421 | Marco Locatelli, Fabio Schoen. On the relation between concavity cuts and the surrogate dual for convex maximization problems |
| 423 | -- | 445 | Immanuel M. Bomze, Werner Schachinger, Gabriele Uchida. Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization |
| 447 | -- | 469 | Hanif D. Sherali, Evrim Dalkiran, Leo Liberti. Reduced RLT representations for nonconvex polynomial programming problems |
| 471 | -- | 485 | Ralf T. Münnich, Ekkehard W. Sachs, Matthias Wagner 0002. Calibration of estimator-weights via semismooth Newton method |
| 487 | -- | 497 | S. Ryuo, K. Sato, Y. Yamamoto. Parameterized fairness axioms on cycle-free graph games |
| 499 | -- | 508 | Nguyen V. Thoai. Criteria and dimension reduction of linear multiple criteria optimization problems |
| 509 | -- | 535 | Le Thi Hoai An, Pham Dinh Tao, Ngai Van Huynh. Exact penalty and error bounds in DC programming |
| 537 | -- | 551 | Julia Sponsel, Stefan Bundfuss, Mirjam Dür. An improved algorithm to test copositivity |
| 553 | -- | 574 | Harold P. Benson. An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem |
| 575 | -- | 590 | Graham R. Wood, Yumi Patton, David W. Fisher. Global energy minimisation and cotranslational protein folding of HP models |
| 591 | -- | 605 | Dominik Dorsch, Vladimir Shikhman, Oliver Stein. Mathematical programs with vanishing constraints: critical point theory |
| 607 | -- | 626 | Yipeng Liu, Gary J. Koehler. A hybrid method for quantum global optimization |
| 627 | -- | 639 | Pham N. Anh, J. K. Kim, Le D. Muu. An extragradient algorithm for solving bilevel pseudomonotone variational inequalities |
| 641 | -- | 661 | Nils Langenberg, Rainer Tichatschke. Interior proximal methods for quasiconvex optimization |