Journals in DBLP

Networks
2001, volume: 38, number: 2

1. Thomas Andreae
   On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:38, n:2, pp:59-67 [Journal]
   
2. J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald
   A polynomial algorithm for a constrained traveling salesman problem. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:38, n:2, pp:68-75 [Journal]
   
3. Martin Zachariasen
   A catalog of Hanan grid problems. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:38, n:2, pp:76-83 [Journal]
   
4. Fred R. McMorris, Fred S. Roberts, Chi Wang
   The center function on trees. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:38, n:2, pp:84-87 [Journal]
   
5. Massimiliano Caramia, Paolo Dell'Olmo
   Solving the minimum-weighted coloring problem. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:38, n:2, pp:88-101 [Journal]
   
6. Rainer E. Burkard, Helidon Dollani
   Robust location problems with pos/neg weights on a tree. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:38, n:2, pp:102-113 [Journal]