Networks

Papers
(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-06-01 to 2024-06-01.)
ArticleCitations
Arc routing problems: A review of the past, present, and future53
Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery51
Future directions in drone routing research51
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
Generating large scale‐free networks with the Chung–Lu random graph model10
Grocery distribution plans in urban networks with street crossing penalties10
Routing electric vehicles with a single recharge per route10
Weighted target set selection on trees and cycles9
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs9
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
Telecommunications network design: Technology impacts and future directions8
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
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
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
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
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
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows2
EETTlib—Energy‐efficient train timetabling library2
A combinatorial branch and bound for the safe set problem2
Last‐mile delivery with drone and lockers2
Minimum k‐cores and the k‐core polytope2
An exact algorithm for the service network design problem with hub capacity constraints2
The firebreak problem2
An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints2
On maximum ratio clique relaxations2
A combinatorial auction‐based approach for ridesharing in a student transportation system2
2
A novel pseudo‐polynomial approach for shortest path problems2
Integrality in the multinetwork min‐cost equal‐flow problem2
Continuous approximation formulas for location problems2
Preface: Special issue on arc routing problems and other related topics2
Decision support for the technician routing and scheduling problem2
The multi‐purpose K‐drones general routing problem2
The hazardous orienteering problem2
Optimal connected subgraphs: Integer programming formulations and polyhedra2
Variable neighborhood search approach with intensified shake for monitor placement2
Formulations and valid inequalities for the capacitated dispersion problem2
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times2
Mobile parcel lockers with individual customer service2
A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs1
2019–2020 Glover‐Klingman Prize Winners1
The k‐path vertex cover: General bounds and chordal graphs1
Maximum weight perfect matching problem with additional disjunctive conflict constraints1
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks1
Learning to repeatedly solve routing problems1
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
Optimal hierarchical clustering on a graph1
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application1
Paths and flows for centrality measures in networks1
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints1
Vertex covering with capacitated trees1
A compact formulation for the base station deployment problem in wireless networks1
Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 20191
Network augmentation for disaster‐resilience against geographically correlated failure1
On matchings, T‐joins, and arc routing in road networks1
Min‐sum controllable risk problems with concave risk functions of the same value range1
Generalized nash fairness solutions for bi‐objective minimization problems1
Applications and efficient algorithms for integer programming problems on monotone constraints1
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing1
1
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots1
Packing returning secretaries1
A simple proof of the Gross‐Saccoman multigraph conjecture1
Approximation algorithms for Steiner forest: An experimental study1
Optimal deployment of indoor wireless local area networks1
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks1
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm1
The consistent production routing problem1
The inventory routing problem with split deliveries1
Tangle bases: Revisited1
Optimizing edge sets in networks to produce ground truth communities based on modularity1
ILP‐based heuristics for a virtual network function placement and routing problem1
Minimum color‐degree perfect b‐matchings1
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator1
Solving the routing and spectrum assignment problem, driven by combinatorial properties1
Impact of knowledge on the cost of treasure hunt in trees1
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group1
The single robot line coverage problem: Theory, algorithms, and experiments1
Hybrid genetic algorithm for undirected traveling salesman problems with profits1
Twenty‐one years in the life of Networks (2000 to 2020)1
Efficient presolving methods for the influence maximization problem1
Fast upper and lower bounds for a large‐scale real‐world arc routing problem1
The cumulative school bus routing problem: Polynomial‐size formulations1
Optimizing concurrency under Scheduling by Edge Reversal1
1
Unimodal eccentricity in trees1
Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)1
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach1
0.023815870285034