Journals in DBLP

Computers & OR
2002, volume: 29, number: 1

1. Giuseppe Bruno, Michel Gendreau, Gilbert Laporte
   A heuristic for the location of a rapid transit line. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:1, pp:1-12 [Journal]
   
2. Tore Grünert, Stefan Irnich, Hans-Jürgen Zimmermann, Markus Schneider, Burkhard Wulfhorst
   Finding all k-cliques in k-partite graphs, an application in textile engineering. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:1, pp:13-31 [Journal]
   
3. I-Ming Chao
   A tabu search method for the truck and trailer routing problem. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:1, pp:33-51 [Journal]
   
4. Elham Ghashghai, Ronald L. Rardin
   Using a hybrid of exact and genetic algorithms to design survivable networks. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:1, pp:53-66 [Journal]
   
5. Said Salhi
   Defining tabu list size and aspiration criterion within tabu search methods. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:1, pp:67-86 [Journal]
   
6. Montaz M. Ali, Aimo A. Törn, Sami Viitanen
   A direct search variant of the simulated annealing algorithm for optimization involving continuous variables. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:1, pp:87-102 [Journal]