| 1 | -- | 5 | Jean B. Lasserre. On representations of the feasible set in convex optimization |
| 7 | -- | 16 | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger. The approximability of three-dimensional assignment problems with bottleneck objective |
| 17 | -- | 28 | X. B. Li, S. J. Li. Existence of solutions for generalized vector quasi-equilibrium problems |
| 29 | -- | 36 | Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos. An efficient string sorting algorithm for weighing matrices of small weight |
| 37 | -- | 55 | Massimiliano Caramia, Antonino Sgalambro. A fast heuristic algorithm for the maximum concurrent ::::k::::-splittable flow problem |
| 57 | -- | 66 | C. S. Lalitha. A note on duality of generalized equilibrium problem |
| 67 | -- | 84 | Yusif S. Gasimov, Abdeljalil Nachaoui, Agaddin A. Niftiyev. p-Laplacian with variable domain |
| 85 | -- | 96 | S. J. Li, P. Zhao. A method of duality for a mixed vector equilibrium problem |
| 97 | -- | 115 | Janine Mukuddem-Petersen, M. P. Mulaudzi, Mark Adam Petersen, I. M. Schoeman. Optimal mortgage loan securitization and the subprime crisis |
| 117 | -- | 129 | Zi Xu. A combined direction stochastic approximation algorithm |
| 131 | -- | 146 | Marco D Apuzzo, Valentina de Simone, Daniela di Serafino. Starting-point strategies for an infeasible potential reduction method |
| 147 | -- | 156 | S. Mehdi Hashemi, Shaghayegh Mokarami, Ebrahim Nasrabadi. Dynamic shortest path problems with time-varying costs |