| 333 | -- | 344 | Alper Atamtürk, Vishnu Narayanan. The submodular knapsack polytope |
| 345 | -- | 361 | Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi. An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem |
| 362 | -- | 369 | Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries. Graph coloring with cardinality constraints on the neighborhoods |
| 370 | -- | 377 | Snezana Mitrovic-Minic, Abraham P. Punnen. Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem |
| 378 | -- | 393 | Vladimir Kolmogorov, Akiyoshi Shioura. New algorithms for convex cost tension problem with application to computer vision |
| 394 | -- | 413 | Dimitris Magos, Ioannis Mourtos. Clique facets of the axial and planar assignment polytopes |
| 414 | -- | 419 | Alexander Grigoriev, Marc Uetz. Scheduling jobs with time-resource tradeoff via nonlinear programming |
| 420 | -- | 435 | Z. Caner Taskin, J. Cole Smith, Shabbir Ahmed, Andrew J. Schaefer. Cutting plane algorithms for solving a stochastic edge-partition problem |
| 436 | -- | 445 | Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski. Chip firing and all-terminal network reliability bounds |
| 446 | -- | 460 | Irina N. Lushchakova. Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines |