| 281 | -- | 289 | Guillermo Gallego, Kaan Katircioglu, Bala Ramachandran. Inventory management under highly uncertain demand |
| 290 | -- | 296 | Shieu-Hong Lin, Nate Gertsch, Jennifer R. Russell. A linear-time algorithm for finding optimal vehicle refueling policies |
| 297 | -- | 307 | Hans van den Berg, Michel Mandjes, Rudesindo Núñez-Queija. Pricing and distributed QoS control for elastic network traffic |
| 308 | -- | 310 | Kyung C. Chae, Kilhwan Kim, Nam K. Kim. Remarks on the remaining service time upon reaching a target level in the M/G/1 queue |
| 311 | -- | 318 | Hanoch Levy, David Raz, Benjamin Avi-Itzhak. Locality of reference and the use of sojourn time variance for measuring queue unfairness |
| 319 | -- | 323 | John N. Tsitsiklis. NP-Hardness of checking the unichain condition in average cost MDPs |
| 324 | -- | 330 | J. Cole Smith, Churlzu Lim, J. Neil Bearden. On the multi-attribute stopping problem with general value functions |
| 331 | -- | 335 | Rainer E. Burkard, Jafar Fathali, Hossein Taghizadeh Kakhki. The p-maxian problem on a tree |
| 336 | -- | 344 | Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika. Finding representative systems for discrete bicriterion optimization problems |
| 345 | -- | 352 | Gautam Appa, Balázs Kotnyek, Konstantinos Papalamprou, Leonidas S. Pitsoulis. Optimization with binet matrices |
| 353 | -- | 356 | Giacomo Zambelli. Colorings of k-balanced matrices and integer decomposition property of related polyhedra |
| 357 | -- | 364 | François Clautiaux, Jacques Carlier, Aziz Moukrim. A new exact method for the two-dimensional bin-packing problem with fixed orientation |
| 365 | -- | 373 | François Clautiaux, Antoine Jouglet, Joseph El Hayek. A new lower bound for the non-oriented two-dimensional bin-packing problem |
| 374 | -- | 378 | Herbert F. Lewis, Thomas R. Sexton. On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem |
| 379 | -- | 384 | Jaroslaw Byrka, Karen Aardal. The approximation gap for the metric facility location problem is not yet closed |
| 385 | -- | 391 | András Frank, Zoltán Király, Balázs Kotnyek. An algorithm for node-capacitated ring routing |
| 392 | -- | 402 | Mourad Baïou, Michel Balinski. Characterizations of the optimal stable allocation mechanism |
| 403 | -- | 408 | Federico Della Croce, M. J. Kaminski, Vangelis Th. Paschos. An exact algorithm for MAX-CUT in sparse graphs |
| 409 | -- | 415 | Yun-Bin Zhao, Jie Hu. Global bounds for the distance to solutions of co-coercive variational inequalities |
| 416 | -- | 418 | Stephen C. Graves. Book review |
| 418 | -- | 419 | Thomas Wilhelm Erlebach. Tim Roughgarden, Selfish Routing and the Price of Anarchy, MIT Press, Cambridge, MA (2005) ISBN 0-262-18243-2, pp 196 |
| 419 | -- | 420 | Diethard Klatte. Jan Brinkhuis and Vladimir Tikhomirov, Editors, Optimization: Insights and Applications, Princeton University Press, Princeton, NJ (2005) ISBN 0-691-10287-2, pp 676 |