| 361 | -- | 372 | Tobias Achterberg, Thorsten Koch, Alexander Martin. MIPLIB 2003 |
| 373 | -- | 381 | Ramprasad Potluri, Lawrence E. Holloway. Determining the right-hand vectors of an irredundant linear inequality system |
| 382 | -- | 386 | Juan González-Hernández, J. Rigoberto Gabriel. On the consistency of the mass transfer problem |
| 387 | -- | 393 | Pierre Bonami, Michel Minoux. Exact MAX-2SAT solution via lift-and-project closure |
| 394 | -- | 404 | Alberto Ceselli, Giovanni Righini. An optimization algorithm for a penalized knapsack problem |
| 405 | -- | 411 | Dennis C. Dietz. A mathematical programming approach to key-based election analysis |
| 412 | -- | 420 | Zeynep Müge Avsar, Melike Baykal-Gursoy. A note on two-person zero-sum communicating stochastic games |
| 421 | -- | 426 | Dachuan Xu, Donglei Du. The ::::k::::-level facility location game |
| 427 | -- | 436 | J. J. Saameño Rodríguez, C. Guerrero García, José Muñoz-Pérez, Enrique Mérida Casermeiro. A general model for the undesirable single facility location problem |
| 437 | -- | 444 | Eduardo Uchoa. Reduction tests for the prize-collecting Steiner problem |
| 445 | -- | 450 | Robert D. Carr, Ojas Parekh. A 1/2-integral relaxation for the ::::A::::-matching problem |
| 451 | -- | 458 | Carl Bussema, Eric Torng. Greedy multiprocessor server scheduling |
| 459 | -- | 464 | Irina V. Gribkovskaia, Chung-Yee Lee, Vitaly A. Strusevich, Dominique de Werra. Three is easy, two is hard: open shop sum-batch scheduling problem refined |
| 465 | -- | 472 | Janny May-Yee Leung, Eugene Levner. An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times |
| 473 | -- | 476 | Zhe George Zhang. On the convexity of the two-threshold policy for an M/G/1 queue with vacations |
| 477 | -- | 0 | Marie-Christine Costa, Lucas Létocart, Frédéric Roupin. Erratum to A greedy algorithm for multicut and integral multiflow in rooted tress [Oper. Res. Lett 31(1) (2003) 21-27] |