| 933 | -- | 943 | Takahito Kuno, Yoshio Sano, Takahiro Tsuruda. Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm |
| 945 | -- | 957 | Andrea Lodi 0001, Ahmad Moradi. Experiments on virtual private network design with concave capacity costs |
| 959 | -- | 969 | Ning Zhang. Two-stage robust mixed integer programming problem with objective uncertainty |
| 971 | -- | 984 | Khanh Duy Pham, Nhut Minh Bui. Error bounds for strongly monotone and Lipschitz continuous variational inequalities |
| 985 | -- | 996 | Cheng Lu, Zhibin Deng. DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs |
| 997 | -- | 1009 | P. J. S. Santos, P. S. M. Santos, Susana Scheimberg. A proximal Newton-type method for equilibrium problems |
| 1011 | -- | 1017 | Peter Frankl. An exact result for (0, ± 1)-vectors |
| 1019 | -- | 1027 | Matthew K. Tam. Algorithms based on unions of nonexpansive maps |
| 1029 | -- | 1044 | Peter Wanke, A. Hadi Vencheh, A. Forghani. A DDF based model for efficiency evaluation in two-stage DEA |
| 1045 | -- | 1063 | Nguyen Nang Tam, Tran Van Nghi. On the solution existence and stability of quadratically constrained nonconvex quadratic programs |
| 1065 | -- | 1077 | Xiucui Guan, Panos M. Pardalos, Binwu Zhang. 1 norm by modifying the sum-cost vector |
| 1079 | -- | 1097 | Mousaab Bouafia, Djamel Benterki, Adnan Yassine. An efficient parameterized logarithmic kernel function for linear optimization |
| 1099 | -- | 1116 | Zsolt Darvay, Petra-Renáta Takács. New method for determining search directions for interior-point algorithms in linear optimization |
| 1117 | -- | 1139 | Zhou Wei, Jen-Chih Yao. On Constraint qualifications of a nonconvex inequality |
| 1141 | -- | 1154 | Joachim Gwinner. An optimization approach to parameter identification in variational inequalities of second kind |
| 1155 | -- | 1156 | Dragan Jukic. An elementary proof of the quadratic envelope characterization of zero-derivative points |