Journals in DBLP

Networks
2004, volume: 43, number: 4

1. 
   From the editors. [Citation Graph (0, 0)][DBLP]
   Networks, 2004, v:43, n:4, pp:- [Journal]
   
2. Deepak Rajan, Alper Atamtürk
   A directed cycle-based column-and-cut generation method for capacitated survivable network design. [Citation Graph (0, 0)][DBLP]
   Networks, 2004, v:43, n:4, pp:201-211 [Journal]
   
3. Tetsuya Fujie
   The maximum-leaf spanning tree problem: Formulations and facets. [Citation Graph (0, 0)][DBLP]
   Networks, 2004, v:43, n:4, pp:212-223 [Journal]
   
4. M. G. Karagiannopoulos, Michael N. Vrahatis, Gerasimos C. Meletiou
   A note on a secure voting system on a public network. [Citation Graph (0, 0)][DBLP]
   Networks, 2004, v:43, n:4, pp:224-225 [Journal]
   
5. Natashia Boland, Horst W. Hamacher, Frank Lenzen
   Minimizing beam-on time in cancer radiation treatment using multileaf collimators. [Citation Graph (0, 0)][DBLP]
   Networks, 2004, v:43, n:4, pp:226-240 [Journal]
   
6. Maria Paola Scaparra, Stefano Pallottino, Maria Grazia Scutellà
   Large-scale local search heuristics for the capacitated vertex p-center problem. [Citation Graph (0, 0)][DBLP]
   Networks, 2004, v:43, n:4, pp:241-255 [Journal]
   
7. Vardges Melkonian, Éva Tardos
   Algorithms for a network design problem with crossing supermodular demands. [Citation Graph (0, 0)][DBLP]
   Networks, 2004, v:43, n:4, pp:256-265 [Journal]
   
8. Sheshayya A. Choudum, R. Usha Nandini
   Complete binary trees in folded and enhanced cubes. [Citation Graph (0, 0)][DBLP]
   Networks, 2004, v:43, n:4, pp:266-272 [Journal]