| 275 | -- | 287 | Reuven Bar-Yehuda, Dror Rawitz. Using fractional primal-dual to schedule split intervals with demands |
| 288 | -- | 298 | Gareth Bendall, François Margot. Greedy-type resistance of combinatorial problems |
| 299 | -- | 316 | Agustín Bompadre, Moshe Dror, James B. Orlin. Improved bounds for vehicle routing solutions |
| 317 | -- | 326 | Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci. Packing into the smallest square: Worst-case analysis of lower bounds |
| 327 | -- | 340 | Dorit S. Hochbaum, Asaf Levin. Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms |
| 341 | -- | 353 | Tamás Kis. Polyhedral results on single node variable upper-bound flow models with allowed configurations |
| 354 | -- | 365 | Sigrid Knust, Michael von Thaden. Balanced home-away assignments |
| 366 | -- | 381 | Alexander V. Kononov, Bertrand M. T. Lin. On relocation problems with multiple identical working crews |
| 382 | -- | 384 | Günes Erdogan, Barbaros Tansel. A note on a polynomial time solvable case of the quadratic assignment problem |
| 385 | -- | 391 | Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen. Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics |
| 392 | -- | 397 | Khaled Salem, Hernán G. Abeledo. Hypergraphs and the Clar problem in hexagonal systems |