| 399 | -- | 408 | C. C. Heyde, S. G. Kou. On the controversy over tailweight of distributions |
| 409 | -- | 414 | Anand Paul, Indranil Bose. Demand variability and incentives in inventory-based contracts |
| 415 | -- | 421 | I. T. Castro, E. L. Sanjuán. Power processes and their application to reliability |
| 422 | -- | 430 | Michael A. Zazanis. Cycle times in single server cyclic Jackson networks |
| 431 | -- | 438 | Refik Güllü. Analysis of an ::::M::::/::::G::::/ queue with batch arrivals and batch-dedicated servers |
| 439 | -- | 447 | Attahiru Sule Alfa. Loss probability in an overloaded discrete-time GI/G/1/K system with very large ::::K:::: |
| 448 | -- | 454 | Lerzan Örmeci, Apostolos Burnetas. Admission control with batch arrivals |
| 455 | -- | 462 | Hanif D. Sherali, Churlzu Lim. On embedding the volume algorithm in a variable target value method |
| 463 | -- | 467 | Javier Peña. Conic systems and sublinear mappings: equivalent approaches |
| 468 | -- | 472 | Kazuo Murota, Hiroo Saito, Robert Weismantel. Optimality criterion for a class of nonlinear integer programs |
| 473 | -- | 478 | Samir Khuller, Yoo Ah Kim. Equivalence of two linear programming relaxations for broadcast scheduling |
| 479 | -- | 484 | Carla P. Gomes, Rommel G. Regis, David B. Shmoys. An improved approximation algorithm for the partial Latin square extension problem |
| 485 | -- | 490 | Nicole Megow, Andreas S. Schulz. On-line scheduling to minimize average completion time revisited |
| 491 | -- | 495 | Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha. An approximation algorithm for the edge-dilation ::::k::::-center problem:::, ::: |
| 496 | -- | 497 | Alberto Caprara. Book reviews |
| 497 | -- | 498 | Gerhard Reinelt. Book review |