| 337 | -- | 340 | Laura Galli, Adam N. Letchford. Small bipartite subgraph polytopes |
| 341 | -- | 345 | Claudia D Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi. On interval-subgradient and no-good cuts |
| 346 | -- | 353 | Dominique Feillet, Michel Gendreau, Andrés L. Medaglia, Jose L. Walteros. A note on branch-and-cut-and-price |
| 354 | -- | 357 | Riccardo Cambini, Francesca Salvi. Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience |
| 358 | -- | 360 | Sheng-Long Hu, Zheng-Hai Huang. Polynomial time solvability of non-symmetric semidefinite programming |
| 361 | -- | 365 | Hayato Waki, Masakazu Muramatsu. A facial reduction algorithm for finding sparse SOS representations |
| 366 | -- | 371 | Jordi Castro, Jordi Cuesta. Existence, uniqueness, and convergence of the regularized primal-dual central path |
| 372 | -- | 377 | Shaohua Pan, Yu-Lin Chang, Jein-Shan Chen. Stationary point conditions for the FB merit function associated with symmetric cones |
| 378 | -- | 382 | Wenqi Huang, Tao Ye. Greedy vacancy search algorithm for packing equal circles in a square |
| 383 | -- | 385 | Johannes Hatzl, Andreas Karrenbauer. A combinatorial algorithm for the 1-median problem in R:::d::: with the Chebyshev norm |
| 386 | -- | 389 | Zhen Wang, Donglei Du, Adriana Felicia Gabor, Dachuan Xu. An approximation algorithm for the k-level stochastic facility location problem |
| 390 | -- | 395 | Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan. Minimizing the sum of weighted completion times in a concurrent open shop |
| 396 | -- | 398 | Stanley P. Y. Fung. Bounded delay packet scheduling in a bounded buffer |
| 399 | -- | 404 | Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità. Stable routing under the Spanning Tree Protocol |
| 405 | -- | 407 | Jiafu Tang, Yuan Kong, Henry C. W. Lau, Andrew W. H. Ip. A note on Efficient feasibility testing for dial-a-ride problems |
| 408 | -- | 413 | H. C. Hwang, Wikrom Jaruphongsa, Sila Çetinkaya, Chung-Yee Lee. Capacitated dynamic lot-sizing problem with delivery/production time windows |
| 414 | -- | 419 | Zhili Zhou, Yongpei Guan. Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs |
| 420 | -- | 426 | Jesse C. Frey, Edward H. Kaplan. Queue inference from periodic reporting data |
| 427 | -- | 431 | Utku Yildirim, John J. Hasenbein. Admission control and pricing in a queue with batch arrivals |
| 432 | -- | 435 | Esa Hyytiä, Samuli Aalto, Aleksi Penttinen, Reijo Sulonen. A stochastic model for a vehicle in a dial-a-ride system |
| 436 | -- | 440 | Harish Krishnan. A note on demand functions with uncertainty |
| 441 | -- | 449 | Yanyi Xu, Arnab Bisi, Maqbool Dada. New structural properties of (s, S) policies for inventory models with lost sales |
| 450 | -- | 453 | Shaoxiang Chen, Jianjun Xu. Note on the optimality of (s, S) policies for inventory systems with two demand classes |
| 454 | -- | 461 | Engin Topan, Z. Pelin Bayindir, Tarkan Tan. An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse |
| 462 | -- | 467 | Weifen Zhuang, Michael Z. F. Li. A new method of proving structural properties for certain class of stochastic dynamic control problems |
| 468 | -- | 473 | Ji Hwan Cha, Eui Yong Lee. An extended stochastic failure model for a system subject to random shocks |
| 474 | -- | 481 | Hoi Ying Wong, Jing Zhao. Valuing American options under the CEV model by Laplace-Carson transforms |
| 482 | -- | 488 | Martin Eling, Luisa Tibiletti. Internal vs. external risk measures: How capital requirements differ in practice |
| 489 | -- | 491 | Ming Liu, Jeremy Staum. Sensitivity analysis of the Eisenberg-Noe model of contagion |
| 492 | -- | 0 | Walter Kern. Book review |