About
Technology
Issues
FAQ
Search
Scientometrics
Impact Factor
Discipline Ranks
h
-index
g
-index
Articles
Citations
Article Citations
Citation Distribution
Overviews
Top Institutions
Top Schools
Top Authors
Prolific Authors
Top Articles
Citing Bodies
Top Citing Authors
Top Citing Institutions
Top Citing Schools
Top Citing Journals
Top Citing Disciplines
exaly
›
Journals
›
Networks
›
top-articles
Networks
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
#
Title
Journal
Year
Citations
1
A survey of gossiping and broadcasting in communication networks
Networks
1988
1,018
2
Complexity of vehicle routing and scheduling problems
Networks
1981
938
3
A generalized assignment heuristic for vehicle routing
Networks
1981
828
4
A tabu search heuristic for periodic and multi-depot vehicle routing problems
Networks
1997
667
5
A quick method for finding shortest pairs of disjoint paths
Networks
1984
607
6
Steiner problem in networks: A survey
Networks
1987
591
7
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey
Networks
2018
568
8
Disjoint paths in a network
Networks
1974
554
9
Steiner tree problems
Networks
1992
530
10
The steiner problem in graphs
Networks
1971
525
11
On the Computational Complexity of Combinatorial Problems
Networks
1975
497
12
The flow deviation method: An approach to store-and-forward communication network design
Networks
1973
479
13
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
Networks
2004
473
14
Capacitated arc routing problems
Networks
1981
456
15
Parallel iterative search methods for vehicle routing problems
Networks
1993
453
16
Total domination in graphs
Networks
1980
442
17
The prize collecting traveling salesman problem
Networks
1989
405
18
Simple heuristics for unit disk graphs
Networks
1995
400
19
Shortest-path network interdiction
Networks
2002
383
20
Sequential updating of conditional probabilities on directed graphical structures
Networks
1990
373
21
Independence properties of directed markov fields
Networks
1990
370
22
A dual algorithm for the constrained shortest path problem
Networks
1980
368
23
Networks and vehicle routing for municipal waste collection
Networks
1974
367
24
Towards a theory of domination in graphs
Networks
1977
353
25
Efficient algorithms for inferring evolutionary trees
Networks
1991
350
26
SNDlib 1.0—Survivable Network Design Library
Networks
2010
344
27
Algorithms for finding paths with multiple constraints
Networks
1984
340
28
Networks synthesis and optimum network design problems: Models, solution methods and applications
Networks
1989
337
29
Euclidean shortest paths in the presence of rectilinear barriers
Networks
1984
330
30
Conditional connectivity
Networks
1983
325
31
Identifying independence in bayesian networks
Networks
1990
320
32
The complexity of the network design problem
Networks
1978
313
33
Dynamic vehicle routing problems: Three decades and counting
Networks
2016
310
34
Steiner's problem in graphs and its implications
Networks
1971
306
35
On cost allocation for a spanning tree: A game theoretic approach
Networks
1976
299
36
Paired-domination in graphs
Networks
1998
289
37
State-space relaxation procedures for the computation of bounds to routing problems
Networks
1981
286
38
Finding optimum branchings
Networks
1977
279
39
The period routing problem
Networks
1984
279
40
Routing with time windows by column generation
Networks
1984
278
41
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
Networks
2003
273
42
On reliability evaluation of a capacitated-flow network in terms of minimal pathsets
Networks
1995
268
43
Classification in vehicle routing and scheduling
Networks
1981
264
44
On the relationship between Nash—Cournot and Wardrop equilibria
Networks
1985
263
45
An algorithm for the equilibrium assignment problem with random link times
Networks
1982
259
46
Multicommodity network flows—A survey
Networks
1978
254
47
Shortest-path algorithms: Taxonomy and annotation
Networks
1984
251
48
An algorithm for the resource constrained shortest path problem
Networks
1989
247
49
Implementing vehicle routing algorithms
Networks
1977
244
50
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
Networks
2007
236
site/software ©
exaly
; All materials licenced under
CC by-SA
.