| 649 | -- | 680 | Marco Di Summa, Andrea Grosso, Marco Locatelli. Branch and cut algorithms for detecting critical nodes in undirected graphs |
| 681 | -- | 709 | Walter Murray, Howard Shek. A local relaxation method for the cardinality constrained portfolio optimization problem |
| 711 | -- | 728 | Paul J. Sutcliffe, Andrew Solomon, Jenny Edwards. Computing the variance of tour costs over the solution space of the TSP in polynomial time |
| 729 | -- | 753 | Kerem Akartunali, Andrew J. Miller. A computational analysis of lower bounds for big bucket production planning problems |
| 755 | -- | 769 | Marc Fuentes, Jérôme Malick, Claude Lemaréchal. Descentwise inexact proximal algorithms for smooth optimization |
| 771 | -- | 794 | Stefania Bellavia, Maria Macconi, Sandra Pieraccini. Constrained Dogleg methods for nonlinear systems with simple bounds |
| 795 | -- | 806 | Zhaocheng Cui, Boying Wu. A new modified nonmonotone adaptive trust region method for unconstrained optimization |
| 807 | -- | 821 | H. L. Luo, X. X. Huang, J. W. Peng. Generalized weak sharp minima in cone-constrained convex optimization with applications |
| 823 | -- | 844 | Hayato Waki, Maho Nakata, Masakazu Muramatsu. Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization |
| 845 | -- | 867 | Yuning Yang, Qingzhi Yang. On solving biquadratic optimization via semidefinite relaxation |
| 869 | -- | 902 | Kalyanmoy Deb, Soumil Srivastava. A genetic algorithm based augmented Lagrangian method for constrained optimization |
| 903 | -- | 931 | Edoardo Patelli, Gerhart I. Schuëller. Computational optimization strategies for the simulation of random media and components |