The SCEAS System
Navigation Menu

Journals in DBLP

Networks
2003, volume: 41, number: 3

  1. Haldun Süral, James H. Bookbinder
    The single-vehicle routing problem with unrestricted backhauls. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:3, pp:127-136 [Journal]
  2. Christian Fremuth-Paeger, Dieter Jungnickel
    Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:3, pp:137-142 [Journal]
  3. Francisco Ortega, Laurence A. Wolsey
    A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:3, pp:143-158 [Journal]
  4. Luis Gouveia, Thomas L. Magnanti
    Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:3, pp:159-173 [Journal]
  5. Ian Frommer, Guruprasad Pundoor
    Small-worlds: A review of recent books. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:3, pp:174-180 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002