| 143 | -- | 147 | Alexander Shapiro. On a time consistency concept in risk averse multistage stochastic programming |
| 148 | -- | 154 | Ulas Özen, Marco Slikker, Henk Norde. A general framework for cooperation under uncertainty |
| 155 | -- | 158 | Deeparnab Chakrabarty, Nikhil R. Devanur. On competitiveness in uniform utility allocation markets |
| 159 | -- | 162 | Karthik S. Gurumoorthy, Arunava Banerjee, Anand Paul. Dynamics of 2-worker bucket brigade assembly line with blocking and instantaneous walk-back |
| 163 | -- | 167 | Ning Cai, Nan Chen, Xiangwei Wan. Pricing double-barrier options under a flexible jump diffusion model |
| 168 | -- | 170 | Olga Gluchshenko, Horst W. Hamacher, Arie Tamir. An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width |
| 171 | -- | 175 | P. M. Dearing, Christiane R. Zeck. A dual algorithm for the minimum covering ball problem in R:::n::: |
| 176 | -- | 180 | Markus Bläser, L. Shankar Ram, Maxim Sviridenko. Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems |
| 181 | -- | 186 | Qiaoming Han, Abraham P. Punnen, Yinyu Ye. An edge-reduction algorithm for the vertex cover problem |
| 187 | -- | 191 | M. Selim Akturk, Alper Atamtürk, Sinan Gurel. A strong conic quadratic reformulation for machine-job assignment with controllable processing times |
| 192 | -- | 196 | A. Agra, Luis Gouveia, Cristina Requejo. Extended formulations for the cardinality constrained subtree of a tree problem |
| 197 | -- | 200 | Maria Grazia Scutellà . On improving optimal oblivious routing |
| 201 | -- | 205 | Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott. Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks |
| 206 | -- | 210 | Antonio Frangioni, Claudio Gentile. A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes |
| 211 | -- | 214 | Patrice Marcotte, D. L. Zhu. Existence and computation of optimal tolls in multiclass network equilibrium problems |
| 215 | -- | 218 | Luce Brotcorne, Saïd Hanafi, Raïd Mansi. A dynamic programming algorithm for the bilevel knapsack problem |
| 219 | -- | 223 | Mehdi Dehghan, Masoud Hajarian. Convergence of SSOR methods for linear complementarity problems |