| 403 | -- | 421 | Yu-Hong Dai, Roger Fletcher. New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds |
| 423 | -- | 432 | Martin E. Dyer, Leen Stougie. Computational complexity of stochastic programming problems |
| 433 | -- | 446 | Shabbir Ahmed. Convexity and decomposition of mean-risk stochastic programs |
| 447 | -- | 452 | Gerhard Reinelt, Dirk Oliver Theis. A note on the Undirected Rural Postman Problem polytope |
| 453 | -- | 466 | Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch. An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure |
| 467 | -- | 489 | Alexandre d Aspremont, Laurent El Ghaoui. Static arbitrage bounds on basket option prices |
| 491 | -- | 511 | Ricardo Fukasawa, Humberto Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis, Eduardo Uchoa, Renato Fonseca F. Werneck. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem |
| 513 | -- | 525 | Xiaojun Chen, Shuhuang Xiang. Computation of Error Bounds for P-matrix Linear Complementarity Problems |
| 527 | -- | 545 | Robert M. Freund. On the behavior of the homogeneous self-dual model for conic convex optimization |
| 547 | -- | 566 | Klaus Jansen. An approximation algorithm for the general max-min resource sharing problem |
| 567 | -- | 586 | Gérard Cornuéjols, Claude Lemaréchal. A convex-analysis perspective on disjunctive cuts |
| 587 | -- | 606 | Jiawang Nie, James Demmel, Bernd Sturmfels. Minimizing Polynomials via Sum of Squares over the Gradient Ideal |