Journals in DBLP

Networks
1998, volume: 32, number: 4

1. Nicholas G. Hall, Wei-Ping Liu, Jeffrey B. Sidney
   Scheduling in broadcast networks. [Citation Graph (0, 0)][DBLP]
   Networks, 1998, v:32, n:4, pp:233-253 [Journal]
   
2. Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez
   A polynomial algorithm for the p-centdian problem on a tree. [Citation Graph (0, 0)][DBLP]
   Networks, 1998, v:32, n:4, pp:255-262 [Journal]
   
3. Michel Gendreau, Gilbert Laporte, Frédéric Semet
   A branch-and-cut algorithm for the undirected selective traveling salesman problem. [Citation Graph (0, 0)][DBLP]
   Networks, 1998, v:32, n:4, pp:263-273 [Journal]
   
4. Michael R. Fellows, Pavol Hell, Karen Seyffarth
   Constructions of large planar networks with given degree and diameter. [Citation Graph (0, 0)][DBLP]
   Networks, 1998, v:32, n:4, pp:275-281 [Journal]
   
5. Sönke Hartmann, Andreas Drexl
   Project scheduling with multiple modes: A comparison of exact algorithms. [Citation Graph (0, 0)][DBLP]
   Networks, 1998, v:32, n:4, pp:283-297 [Journal]
   
6. Khee Meng Koh, Eng Guan Tay
   On optimal orientations of Cartesian products of even cycles. [Citation Graph (0, 0)][DBLP]
   Networks, 1998, v:32, n:4, pp:299-306 [Journal]
   
7. Jung-Sing Jwo, Tai-Ching Tuan
   On container length and connectivity in unidirectional hypercubes. [Citation Graph (0, 0)][DBLP]
   Networks, 1998, v:32, n:4, pp:307-317 [Journal]