| 221 | -- | 230 | Mihály Bárász, Johanna Becker, András Frank. An algorithm for source location in directed graphs |
| 231 | -- | 234 | David Pearson. A polynomial-time algorithm for the change-making problem |
| 235 | -- | 241 | Ryuhei Miyashiro, Tomomi Matsui. A polynomial-time algorithm to find an equitable home-away assignment |
| 242 | -- | 248 | Refael Hassin, Jérôme Monnot. The maximum saving partition problem |
| 249 | -- | 254 | Satyaveer Singh Chauhan, Anton V. Eremeev, Anna A. Romanova, Vladimir V. Servakh, Gerhard J. Woeginger. Approximation of the supply scheduling problem |
| 255 | -- | 262 | Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich. Two-machine flow shop scheduling problems with no-wait jobs |
| 263 | -- | 266 | Igor Averbakh, Oded Berman, Ilya Chernykh. The ::::m::::-machine flowshop problem with unit-time operations and intree precedence constraints |
| 267 | -- | 273 | Nikhil Bansal. Minimizing flow time on a constant number of machines with preemption |
| 274 | -- | 284 | Ada Che, Chengbin Chu. A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line |
| 285 | -- | 288 | Flip Klijn, Marco Slikker. Distribution center consolidation games |
| 289 | -- | 294 | Xiaolong Zhang. Delayed demand information and dampened bullwhip effect |
| 295 | -- | 300 | Tsuyoshi Katayama. Level-crossing approach to a time-limited service system with two types of vacations |
| 301 | -- | 304 | Seyed M. R. Iravani, Bora Kolfal. When does the ::::cµ:::: rule apply to finite-population queueing systems? |
| 305 | -- | 311 | Alpár Jüttner. Optimization with additional variables and constraints |
| 312 | -- | 318 | Oleg A. Prokopyev, Hong-Xuan Huang, Panos M. Pardalos. On complexity of unconstrained hyperbolic 0-1 programming problems |
| 319 | -- | 330 | Garud Iyengar, Wanmo Kang. Inverse conic programming with applications |