| 247 | -- | 252 | Alain Hertz, Marino Widmer. Guidelines for the use of meta-heuristics in combinatorial optimization |
| 253 | -- | 264 | Kenneth Sörensen, Gerrit K. Janssens. Data mining with genetic algorithms on binary trees |
| 265 | -- | 279 | Refael Hassin, Asaf Levin, Dana Morad. Lexicographic local search and the p |
| 280 | -- | 295 | Bernard Fortz, Patrick Soriano, Christelle Wynants. A tabu search algorithm for self-healing ring network design |
| 296 | -- | 306 | Marc Sevaux, Stéphane Dauzère-Pérès. Genetic algorithms to minimize the weighted number of late jobs on a single machine |
| 307 | -- | 332 | Tamás Kis. Job-shop scheduling with processing alternatives |
| 333 | -- | 351 | Maria João Cortinhal, M. Eugénia V. Captivo. Upper and lower bounds for the single source capacitated location problem |
| 352 | -- | 364 | Andrzej Jaszkiewicz, Pawel Kominek. Genetic local search with distance preserving recombination operator for a vehicle routing problem |
| 365 | -- | 378 | José A. Moreno-Pérez, J. Marcos Moreno-Vega, Inmaculada Rodríguez Martín. Variable neighborhood tabu search and its application to the median cycle problem |
| 379 | -- | 388 | Cédric Avanthay, Alain Hertz, Nicolas Zufferey. A variable neighborhood search for graph coloring |
| 389 | -- | 399 | Nenad Mladenovic, J. Petrovic, Vera Kovacevic-Vujcic, Mirjana Cangalovic. Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search |
| 400 | -- | 414 | Andreas Fink, Stefan Voß. Solving the continuous flow-shop scheduling problem by metaheuristics |
| 415 | -- | 433 | Michel Gourgand, Nathalie Grangeon, Sylvie Norre. A contribution to the stochastic flow shop scheduling problem |
| 434 | -- | 446 | Ana R. Xambre, Pedro M. Vilarinho. A simulated annealing approach for manufacturing cell formation with multiple identical machines |