Journals in DBLP

Networks
2003, volume: 42, number: 1

1. Alexandra Makri, Diego Klabjan
   Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:1, pp:1-14 [Journal]
   
2. Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana
   The spectra of wrapped butterfly digraphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:1, pp:15-19 [Journal]
   
3. Frank K. Hwang, Wen-Dar Lin
   A general construction for nonblocking crosstalk-free photonic switching networks. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:1, pp:20-25 [Journal]
   
4. Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi
   An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:1, pp:26-41 [Journal]
   
5. Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni
   The facility location problem with general cost functions. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:1, pp:42-47 [Journal]
   
6. Nenad Mladenovic, Martine Labbé, Pierre Hansen
   Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:1, pp:48-64 [Journal]