Networks

Papers
(The TQCC of Networks is 3. 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-06-01 to 2024-06-01.)
ArticleCitations
Arc routing problems: A review of the past, present, and future53
Future directions in drone routing research51
Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery51
A branch‐and‐cut approach and alternative formulations for the traveling salesman problem with drone41
Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers33
Solving Steiner trees: Recent advances, challenges, and perspectives31
Cost‐optimal truck‐and‐robot routing for last‐mile delivery31
In search of network resilience: An optimization‐based view28
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers28
Modeling the flying sidekick traveling salesman problem with multiple drones25
Trucks and drones cooperation in the last‐mile delivery process25
An exact bidirectional pulse algorithm for the constrained shortest path24
Network reliability: Heading out on the highway23
A two‐tier urban delivery network with robot‐based deliveries22
“Make no little plans”: Impactful research to solve the next generation of transportation problems21
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements20
Controller placement problem in software‐defined networking: A survey19
Parcel delivery cost minimization with time window constraints using trucks and drones18
Integrating production scheduling and transportation procurement through combinatorial auctions15
Large‐scale zone‐based evacuation planning—Part I: Models and algorithms13
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach13
Effects of update frequencies in a dynamic capacitated arc routing problem12
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks12
Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations12
Fast reliability ranking of matchstick minimal networks11
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs11
Grocery distribution plans in urban networks with street crossing penalties10
Routing electric vehicles with a single recharge per route10
Generating large scale‐free networks with the Chung–Lu random graph model10
Directions for future research on urban mobility and city logistics9
An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network9
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems9
Weighted target set selection on trees and cycles9
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs9
Large‐scale zone‐based evacuation planning, Part II: Macroscopic and microscopic evaluations8
On approximate data reduction for the Rural Postman Problem: Theory and experiments8
A story of diameter, radius, and (almost) Helly property8
The family traveling salesman problem with incompatibility constraints8
Telecommunications network design: Technology impacts and future directions8
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks7
Uniformly optimally reliable graphs: A survey7
Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem7
Roots of two‐terminal reliability polynomials6
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures6
Balanced cable routing for offshore wind farms with obstacles6
The mixed capacitated general routing problem with time‐dependent demands6
Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge6
A new MILP formulation for the flying sidekick traveling salesman problem5
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings5
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems5
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem5
A two‐step optimization model for the distribution of perishable products5
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location5
Plowing with precedence in polynomial time5
An integrated user‐system approach for shelter location and evacuation routing5
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods5
An extreme‐point tabu‐search algorithm for fixed‐charge network problems5
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops5
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions4
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem4
Targeted multiobjective Dijkstra algorithm4
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation4
The time‐consistent dial‐a‐ride problem4
Most reliable two‐terminal graphs with node failures4
A fast maximum flow algorithm4
4
Braess' paradox: A cooperative game‐theoretic point of view4
Minimum cost flow problem with conflicts4
In search of dense subgraphs: How good is greedy peeling?4
The Gross–Saccoman conjecture is true4
Finding minimum label spanning trees using cross‐entropy method3
Efficient algorithms for finding 2‐medians of a tree3
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries3
Solving vehicle routing problems with intermediate stops using VRPSolver models3
Optimizing the ecological connectivity of landscapes3
Combinatorial acyclicity models for potential‐based flows3
Improving a constructive heuristic for the general routing problem3
A branch‐and‐dive heuristic for single vehicle snow removal3
A multi‐vehicle covering tour problem with speed optimization3
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks3
The parking warden tour problem3
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows3
On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems3
0.027828931808472