Networks

Article	Citations
Future directions in drone routing research	49
Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery	45
Arc routing problems: A review of the past, present, and future	45
A branch‐and‐cut approach and alternative formulations for the traveling salesman problem with drone	39
Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers	29
Solving Steiner trees: Recent advances, challenges, and perspectives	28
Cost‐optimal truck‐and‐robot routing for last‐mile delivery	27
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers	26
Network reliability: Heading out on the highway	23
In search of network resilience: An optimization‐based view	23
Modeling the flying sidekick traveling salesman problem with multiple drones	23
Trucks and drones cooperation in the last‐mile delivery process	22
An exact bidirectional pulse algorithm for the constrained shortest path	22
A two‐tier urban delivery network with robot‐based deliveries	20
“Make no little plans”: Impactful research to solve the next generation of transportation problems	20
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements	18
Parcel delivery cost minimization with time window constraints using trucks and drones	18
Controller placement problem in software‐defined networking: A survey	17
Integrating production scheduling and transportation procurement through combinatorial auctions	15
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach	12
Effects of update frequencies in a dynamic capacitated arc routing problem	12
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks	11
Fast reliability ranking of matchstick minimal networks	11
Large‐scale zone‐based evacuation planning—Part I: Models and algorithms	11
Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations	10

Grocery distribution plans in urban networks with street crossing penalties	10
Generating large scale‐free networks with the Chung–Lu random graph model	10
Routing electric vehicles with a single recharge per route	10
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs	10
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs	9
On the road to better routes: Five decades of published research on the vehicle routing problem	9
The K‐partitioning problem: Formulations and branch‐and‐cut	8
A branch‐and‐cut approach for the least cost influence problem on social networks	8
Directions for future research on urban mobility and city logistics	8
A story of diameter, radius, and (almost) Helly property	8
Large‐scale zone‐based evacuation planning, Part II: Macroscopic and microscopic evaluations	8
On approximate data reduction for the Rural Postman Problem: Theory and experiments	8
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks	7
An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network	7
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems	7
Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem	7
Weighted target set selection on trees and cycles	7
Telecommunications network design: Technology impacts and future directions	7
The family traveling salesman problem with incompatibility constraints	7
Roots of two‐terminal reliability polynomials	6
Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge	6
Uniformly optimally reliable graphs: A survey	6
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures	5
An extreme‐point tabu‐search algorithm for fixed‐charge network problems	5
Plowing with precedence in polynomial time	5
A two‐step optimization model for the distribution of perishable products	5
The mixed capacitated general routing problem with time‐dependent demands	5
Balanced cable routing for offshore wind farms with obstacles	5
An integrated user‐system approach for shelter location and evacuation routing	5
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings	5
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	5
Braess' paradox: A cooperative game‐theoretic point of view	4
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	4
Minimum cost flow problem with conflicts	4
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem	4
The Gross–Saccoman conjecture is true	4
A new MILP formulation for the flying sidekick traveling salesman problem	4
Most reliable two‐terminal graphs with node failures	4
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem	4
In search of dense subgraphs: How good is greedy peeling?	4
The time‐consistent dial‐a‐ride problem	4
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions	4
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location	4
A fast maximum flow algorithm	4
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation	4
The stochastic critical node problem over trees	3
Efficient algorithms for finding 2‐medians of a tree	3
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries	3
Solving vehicle routing problems with intermediate stops using VRPSolver models	3
Optimizing the ecological connectivity of landscapes	3

Combinatorial acyclicity models for potential‐based flows	3
Spanning tree modulus for secure broadcast games	3
A branch‐and‐dive heuristic for single vehicle snow removal	3
A multi‐vehicle covering tour problem with speed optimization	3
On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems	3
Finding minimum label spanning trees using cross‐entropy method	3
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows	3
The parking warden tour problem	3
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	3
Decision support for the technician routing and scheduling problem	2
The hazardous orienteering problem	2
Formulations and valid inequalities for the capacitated dispersion problem	2
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks	2
Improving a constructive heuristic for the general routing problem	2
Preface: Special issue on arc routing problems and other related topics	2
	2
Optimal connected subgraphs: Integer programming formulations and polyhedra	2
	2
A novel pseudo‐polynomial approach for shortest path problems	2
Integrality in the multinetwork min‐cost equal‐flow problem	2
The firebreak problem	2
An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints	2
On maximum ratio clique relaxations	2
EETTlib—Energy‐efficient train timetabling library	2
A combinatorial auction‐based approach for ridesharing in a student transportation system	2
A combinatorial branch and bound for the safe set problem	2
Minimum k‐cores and the k‐core polytope	2
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times	2
Targeted multiobjective Dijkstra algorithm	2
The multi‐purpose K‐drones general routing problem	2
Optimizing concurrency under Scheduling by Edge Reversal	1
An exact algorithm for the service network design problem with hub capacity constraints	1
Unimodal eccentricity in trees	1
Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)	1
Continuous approximation formulas for location problems	1
Applications and efficient algorithms for integer programming problems on monotone constraints	1
Minimum color‐degree perfect b‐matchings	1
Min‐sum controllable risk problems with concave risk functions of the same value range	1
Solving the routing and spectrum assignment problem, driven by combinatorial properties	1
A simple proof of the Gross‐Saccoman multigraph conjecture	1
Impact of knowledge on the cost of treasure hunt in trees	1
Efficient presolving methods for the influence maximization problem	1
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	1
Learning to repeatedly solve routing problems	1
Optimal hierarchical clustering on a graph	1
	1
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks	1
Vertex covering with capacitated trees	1
Mobile parcel lockers with individual customer service	1
Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 2019	1
Network augmentation for disaster‐resilience against geographically correlated failure	1
ILP‐based heuristics for a virtual network function placement and routing problem	1
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach	1
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator	1
2019–2020 Glover‐Klingman Prize Winners	1
A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs	1
Maximum weight perfect matching problem with additional disjunctive conflict constraints	1
Last‐mile delivery with drone and lockers	1
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows	1
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots	1
Paths and flows for centrality measures in networks	1
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application	1
Approximation algorithms for Steiner forest: An experimental study	1
Packing returning secretaries	1
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm	1
The consistent production routing problem	1
The inventory routing problem with split deliveries	1
Tangle bases: Revisited	1
Optimizing edge sets in networks to produce ground truth communities based on modularity	1
Variable neighborhood search approach with intensified shake for monitor placement	1
On matchings, T‐joins, and arc routing in road networks	1
The k‐path vertex cover: General bounds and chordal graphs	1
Generalized nash fairness solutions for bi‐objective minimization problems	1
An efficient approach to optimization of semi‐stable routing in multicommodity flow networks	1
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	1
Appreciation to Referees	1
The single robot line coverage problem: Theory, algorithms, and experiments	1
Hybrid genetic algorithm for undirected traveling salesman problems with profits	1
Twenty‐one years in the life of Networks (2000 to 2020)	1
A compact formulation for the base station deployment problem in wireless networks	1

Fast upper and lower bounds for a large‐scale real‐world arc routing problem

1