(The median citation count of Networks is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-02-01 to 2024-02-01.)
Future directions in drone routing research46
Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery43
Arc routing problems: A review of the past, present, and future42
A branch‐and‐cut approach and alternative formulations for the traveling salesman problem with drone36
Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers29
Solving Steiner trees: Recent advances, challenges, and perspectives26
Cost‐optimal truck‐and‐robot routing for last‐mile delivery25
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers25
Network reliability: Heading out on the highway22
Trucks and drones cooperation in the last‐mile delivery process21
Modeling the flying sidekick traveling salesman problem with multiple drones21
A two‐tier urban delivery network with robot‐based deliveries20
“Make no little plans”: Impactful research to solve the next generation of transportation problems20
In search of network resilience: An optimization‐based view19
An exact bidirectional pulse algorithm for the constrained shortest path18
Parcel delivery cost minimization with time window constraints using trucks and drones16
Controller placement problem in software‐defined networking: A survey16
Integrating production scheduling and transportation procurement through combinatorial auctions15
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements13
Effects of update frequencies in a dynamic capacitated arc routing problem12
Fast reliability ranking of matchstick minimal networks11
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks11
Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations10
Content placement in 5G‐enabled edge/core data center networks resilient to link cut attacks10
Generating large scale‐free networks with the Chung–Lu random graph model10
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach10
The Earth is nearly flat: Precise and approximate algorithms for detecting vulnerable regions of networks in the plane and on the sphere10
Grocery distribution plans in urban networks with street crossing penalties10
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs9
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs9
On the road to better routes: Five decades of published research on the vehicle routing problem9
Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows9
Routing electric vehicles with a single recharge per route9
Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort8
The policy graph decomposition of multistage stochastic programming problems8
Large‐scale zone‐based evacuation planning—Part I: Models and algorithms8
On approximate data reduction for the Rural Postman Problem: Theory and experiments8
Telecommunications network design: Technology impacts and future directions7
Directions for future research on urban mobility and city logistics7
A branch‐and‐cut approach for the least cost influence problem on social networks7
Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem7
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks7
A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity7
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems7
A story of diameter, radius, and (almost) Helly property7
The K‐partitioning problem: Formulations and branch‐and‐cut6
Uniformly optimally reliable graphs: A survey6
The family traveling salesman problem with incompatibility constraints6
Large‐scale zone‐based evacuation planning, Part II: Macroscopic and microscopic evaluations6
An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network6
Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge6
Roots of two‐terminal reliability polynomials6
Resilience of communication networks to random failures and disasters: An optimization perspective6
Weighted target set selection on trees and cycles5
A two‐step optimization model for the distribution of perishable products5
An integrated user‐system approach for shelter location and evacuation routing5
An extreme‐point tabu‐search algorithm for fixed‐charge network problems5
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures5
Plowing with precedence in polynomial time5
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods4
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings4
Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes4
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem4
The time‐consistent dial‐a‐ride problem4
Most reliable two‐terminal graphs with node failures4
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems4
The mixed capacitated general routing problem with time‐dependent demands4
Balanced cable routing for offshore wind farms with obstacles4
Braess' paradox: A cooperative game‐theoretic point of view4
Minimum cost flow problem with conflicts4
A fast maximum flow algorithm4
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem4
The Gross–Saccoman conjecture is true4
The stochastic critical node problem over trees3
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions3
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows3
The parking warden tour problem3
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops3
Combinatorial acyclicity models for potential‐based flows3
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries3
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location3
Dual‐failure restorability analysis of span‐restorable meta‐mesh networks3
On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems3
Finding minimum label spanning trees using cross‐entropy method3
Efficient algorithms for finding 2‐medians of a tree3
A branch‐and‐dive heuristic for single vehicle snow removal3
Solving vehicle routing problems with intermediate stops using VRPSolver models3
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation3
On maximum ratio clique relaxations2
Minimum shared‐power edge cut2
Optimal connected subgraphs: Integer programming formulations and polyhedra2
A combinatorial branch and bound for the safe set problem2
A novel pseudo‐polynomial approach for shortest path problems2
Integrality in the multinetwork min‐cost equal‐flow problem2
The firebreak problem2
In search of dense subgraphs: How good is greedy peeling?2
Decision support for the technician routing and scheduling problem2
A combinatorial auction‐based approach for ridesharing in a student transportation system2
Robust network function virtualization2
Minimum k‐cores and the k‐core polytope2
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times2
A multi‐vehicle covering tour problem with speed optimization2
An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints2
EETTlib—Energy‐efficient train timetabling library2
Optimizing the ecological connectivity of landscapes2
Formulations and valid inequalities for the capacitated dispersion problem2
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks2
Spanning tree modulus for secure broadcast games2
Preface: Special issue on arc routing problems and other related topics2
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator1
Optimizing edge sets in networks to produce ground truth communities based on modularity1
The k‐path vertex cover: General bounds and chordal graphs1
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing1
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots1
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows1
A new MILP formulation for the flying sidekick traveling salesman problem1
Appreciation to Referees1
Approximation algorithms for Steiner forest: An experimental study1
Paths and flows for centrality measures in networks1
Vertex covering with capacitated trees1
An exact algorithm for the service network design problem with hub capacity constraints1
The inventory routing problem with split deliveries1
Minimum color‐degree perfect b‐matchings1
Variable neighborhood search approach with intensified shake for monitor placement1
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach1
The hazardous orienteering problem1
Solving the routing and spectrum assignment problem, driven by combinatorial properties1
Min‐sum controllable risk problems with concave risk functions of the same value range1
Targeted multiobjective Dijkstra algorithm1
Hybrid genetic algorithm for undirected traveling salesman problems with profits1
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set1
An efficient approach to optimization of semi‐stable routing in multicommodity flow networks1
Twenty‐one years in the life of Networks (2000 to 2020)1
Efficient presolving methods for the influence maximization problem1
Packing returning secretaries1
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm1
Routing and scheduling of network flows with deadlines and discrete capacity allocation1
The consistent production routing problem1
Network augmentation for disaster‐resilience against geographically correlated failure1
Tangle bases: Revisited1
Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 20191
Applications and efficient algorithms for integer programming problems on monotone constraints1
Continuous approximation formulas for location problems1
Maximum weight perfect matching problem with additional disjunctive conflict constraints1
Learning to repeatedly solve routing problems1
Impact of knowledge on the cost of treasure hunt in trees1
Last‐mile delivery with drone and lockers1
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks1
A simple proof of the Gross‐Saccoman multigraph conjecture1
Optimal hierarchical clustering on a graph1
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application1
Fast upper and lower bounds for a large‐scale real‐world arc routing problem1
Optimizing concurrency under Scheduling by Edge Reversal1
The multi‐purpose K‐drones general routing problem1
Improving a constructive heuristic for the general routing problem1
Unimodal eccentricity in trees1
Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)1
On matchings, T‐joins, and arc routing in road networks1