1.9(top 20%)
impact factor
2.3K(top 10%)
papers
67.6K(top 5%)
citations
114(top 5%)
h-index
1.9(top 50%)
impact factor
3.2K
all documents
72.2K
doc citations
189(top 5%)
g-index

Top Articles

#TitleJournalYearCitations
1A survey of gossiping and broadcasting in communication networksNetworks19881,018
2Complexity of vehicle routing and scheduling problemsNetworks1981938
3A generalized assignment heuristic for vehicle routingNetworks1981828
4A tabu search heuristic for periodic and multi-depot vehicle routing problemsNetworks1997667
5A quick method for finding shortest pairs of disjoint pathsNetworks1984607
6Steiner problem in networks: A surveyNetworks1987591
7Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A surveyNetworks2018568
8Disjoint paths in a networkNetworks1974554
9Steiner tree problemsNetworks1992530
10The steiner problem in graphsNetworks1971525
11On the Computational Complexity of Combinatorial ProblemsNetworks1975497
12The flow deviation method: An approach to store-and-forward communication network designNetworks1973479
13An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problemsNetworks2004473
14Capacitated arc routing problemsNetworks1981456
15Parallel iterative search methods for vehicle routing problemsNetworks1993453
16Total domination in graphsNetworks1980442
17The prize collecting traveling salesman problemNetworks1989405
18Simple heuristics for unit disk graphsNetworks1995400
19Shortest-path network interdictionNetworks2002383
20Sequential updating of conditional probabilities on directed graphical structuresNetworks1990373
21Independence properties of directed markov fieldsNetworks1990370
22A dual algorithm for the constrained shortest path problemNetworks1980368
23Networks and vehicle routing for municipal waste collectionNetworks1974367
24Towards a theory of domination in graphsNetworks1977353
25Efficient algorithms for inferring evolutionary treesNetworks1991350
26SNDlib 1.0—Survivable Network Design LibraryNetworks2010344
27Algorithms for finding paths with multiple constraintsNetworks1984340
28Networks synthesis and optimum network design problems: Models, solution methods and applicationsNetworks1989337
29Euclidean shortest paths in the presence of rectilinear barriersNetworks1984330
30Conditional connectivityNetworks1983325
31Identifying independence in bayesian networksNetworks1990320
32The complexity of the network design problemNetworks1978313
33Dynamic vehicle routing problems: Three decades and countingNetworks2016310
34Steiner's problem in graphs and its implicationsNetworks1971306
35On cost allocation for a spanning tree: A game theoretic approachNetworks1976299
36Paired-domination in graphsNetworks1998289
37State-space relaxation procedures for the computation of bounds to routing problemsNetworks1981286
38Finding optimum branchingsNetworks1977279
39The period routing problemNetworks1984279
40Routing with time windows by column generationNetworks1984278
41A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networksNetworks2003273
42On reliability evaluation of a capacitated-flow network in terms of minimal pathsetsNetworks1995268
43Classification in vehicle routing and schedulingNetworks1981264
44On the relationship between Nash—Cournot and Wardrop equilibriaNetworks1985263
45An algorithm for the equilibrium assignment problem with random link timesNetworks1982259
46Multicommodity network flows—A surveyNetworks1978254
47Shortest-path algorithms: Taxonomy and annotationNetworks1984251
48An algorithm for the resource constrained shortest path problemNetworks1989247
49Implementing vehicle routing algorithmsNetworks1977244
50Models and branch-and-cut algorithms for pickup and delivery problems with time windowsNetworks2007236