Journals in DBLP

Networks
2000, volume: 36, number: 1

1. Geir Dahl, Bjørnar Realfsen
   The cardinality-constrained shortest path problem in 2-graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:36, n:1, pp:1-8 [Journal]
   
2. S. Trilochan Sastry
   A characterization of the two-commodity network design problem. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:36, n:1, pp:9-16 [Journal]
   
3. Walid Ben-Ameur
   Constrained length connectivity and survivable networks. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:36, n:1, pp:17-33 [Journal]
   
4. Egon Balas, Maarten Oosten
   On the cycle polytope of a directed graph. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:36, n:1, pp:34-46 [Journal]
   
5. Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann
   Minimizing the complexity of an activity network. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:36, n:1, pp:47-52 [Journal]
   
6. P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
   New polynomial-time cycle-canceling algorithms for minimum-cost flows. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:36, n:1, pp:53-63 [Journal]
   
7. D. DiMarco
   Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:36, n:1, pp:64-67 [Journal]