Networks

Article	Citations
Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery	53
Future directions in drone routing research	51
Cost‐optimal truck‐and‐robot routing for last‐mile delivery	34
Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers	34
Solving Steiner trees: Recent advances, challenges, and perspectives	33
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers	29
In search of network resilience: An optimization‐based view	28
Trucks and drones cooperation in the last‐mile delivery process	26
Modeling the flying sidekick traveling salesman problem with multiple drones	25
Network reliability: Heading out on the highway	24
“Make no little plans”: Impactful research to solve the next generation of transportation problems	22
A two‐tier urban delivery network with robot‐based deliveries	22
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements	21
Controller placement problem in software‐defined networking: A survey	19
Parcel delivery cost minimization with time window constraints using trucks and drones	18
Integrating production scheduling and transportation procurement through combinatorial auctions	15
Large‐scale zone‐based evacuation planning—Part I: Models and algorithms	13
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach	13
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks	12
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs	12
Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations	12
Effects of update frequencies in a dynamic capacitated arc routing problem	12
Generating large scale‐free networks with the Chung–Lu random graph model	11
Fast reliability ranking of matchstick minimal networks	11
Grocery distribution plans in urban networks with street crossing penalties	10

Directions for future research on urban mobility and city logistics	10
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs	9
The family traveling salesman problem with incompatibility constraints	9
Weighted target set selection on trees and cycles	9
An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network	9
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems	9
A story of diameter, radius, and (almost) Helly property	9
On approximate data reduction for the Rural Postman Problem: Theory and experiments	8
Large‐scale zone‐based evacuation planning, Part II: Macroscopic and microscopic evaluations	8
Telecommunications network design: Technology impacts and future directions	8
Uniformly optimally reliable graphs: A survey	7
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks	7
The mixed capacitated general routing problem with time‐dependent demands	7
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	6
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings	6
Balanced cable routing for offshore wind farms with obstacles	6
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures	6
Roots of two‐terminal reliability polynomials	6
A new MILP formulation for the flying sidekick traveling salesman problem	6
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem	6
An integrated user‐system approach for shelter location and evacuation routing	5
An extreme‐point tabu‐search algorithm for fixed‐charge network problems	5
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	5
A two‐step optimization model for the distribution of perishable products	5
Minimum cost flow problem with conflicts	5
Plowing with precedence in polynomial time	5
The time‐consistent dial‐a‐ride problem	5
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location	5
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem	5
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	5
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation	4
Most reliable two‐terminal graphs with node failures	4
Targeted multiobjective Dijkstra algorithm	4
The Gross–Saccoman conjecture is true	4
Braess' paradox: A cooperative game‐theoretic point of view	4
A fast maximum flow algorithm	4
	4
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions	4
In search of dense subgraphs: How good is greedy peeling?	4
Finding minimum label spanning trees using cross‐entropy method	3
Efficient algorithms for finding 2‐medians of a tree	3
Improving a constructive heuristic for the general routing problem	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
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks	3
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries	3
The parking warden tour problem	3
The multi‐purpose K‐drones general routing problem	3
Combinatorial acyclicity models for potential‐based flows	3
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows	3

A branch‐and‐dive heuristic for single vehicle snow removal	3
Solving vehicle routing problems with intermediate stops using VRPSolver models	3
Optimizing the ecological connectivity of landscapes	3
Preface: Special issue on arc routing problems and other related topics	2
On maximum ratio clique relaxations	2
Optimal connected subgraphs: Integer programming formulations and polyhedra	2
Variable neighborhood search approach with intensified shake for monitor placement	2
A combinatorial branch and bound for the safe set problem	2
A novel pseudo‐polynomial approach for shortest path problems	2
Integrality in the multinetwork min‐cost equal‐flow problem	2
Continuous approximation formulas for location problems	2
Mobile parcel lockers with individual customer service	2
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows	2
EETTlib—Energy‐efficient train timetabling library	2
A combinatorial auction‐based approach for ridesharing in a student transportation system	2
The hazardous orienteering problem	2
Formulations and valid inequalities for the capacitated dispersion problem	2
Last‐mile delivery with drone and lockers	2
An exact algorithm for the service network design problem with hub capacity constraints	2
The firebreak problem	2
An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints	2
Decision support for the technician routing and scheduling problem	2
	2
Minimum k‐cores and the k‐core polytope	2
The consistent production routing problem	2
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times	2
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem	1
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group	1
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	1
Applications and efficient algorithms for integer programming problems on monotone constraints	1
2019–2020 Glover‐Klingman Prize Winners	1
Min‐sum controllable risk problems with concave risk functions of the same value range	1
A simple proof of the Gross‐Saccoman multigraph conjecture	1
Paths and flows for centrality measures in networks	1
Hybrid genetic algorithm for undirected traveling salesman problems with profits	1
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	1
The cumulative school bus routing problem: Polynomial‐size formulations	1
Fast upper and lower bounds for a large‐scale real‐world arc routing problem	1
	1
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	1
The inventory routing problem with split deliveries	1
Network augmentation for disaster‐resilience against geographically correlated failure	1
On matchings, T‐joins, and arc routing in road networks	1
Generalized nash fairness solutions for bi‐objective minimization problems	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
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator	1
	1
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks	1
Efficient presolving methods for the influence maximization problem	1
Twenty‐one years in the life of Networks (2000 to 2020)	1
Learning to repeatedly solve routing problems	1
Optimal hierarchical clustering on a graph	1
Optimal deployment of indoor wireless local area networks	1
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks	1
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm	1
Vertex covering with capacitated trees	1
Unimodal eccentricity in trees	1
Optimizing edge sets in networks to produce ground truth communities based on modularity	1
Minimum color‐degree perfect b‐matchings	1
Solving the routing and spectrum assignment problem, driven by combinatorial properties	1
ILP‐based heuristics for a virtual network function placement and routing problem	1
Impact of knowledge on the cost of treasure hunt in trees	1
The k‐path vertex cover: General bounds and chordal graphs	1
An efficient approach to optimization of semi‐stable routing in multicommodity flow networks	1
The single robot line coverage problem: Theory, algorithms, and experiments	1
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots	1
	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
A compact formulation for the base station deployment problem in wireless networks	1
Packing returning secretaries	1
Optimizing concurrency under Scheduling by Edge Reversal	1
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints	1
Tangle bases: Revisited	1
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach	1
Preface	0
Issue Information	0
	0
	0

Shortest path network interdiction with asymmetric uncertainty	0
	0
	0
The invisible‐hand heuristic for origin‐destination integer multicommodity network flows	0
Avoiding unnecessary demerging and remerging of multi‐commodity integer flows	0
The b‐bibranching problem: TDI system, packing, and discrete convexity	0
Maximum flow‐based formulation for the optimal location of electric vehicle charging stations	0
On the split reliability of graphs	0
	0
Collaborative transportation for attended home deliveries	0
Issue Information	0
Virtual network function reconfiguration in 5G networks: An optimization perspective	0
A tabu search with geometry‐based sparsification methods for angular traveling salesman problems	0
The node cop‐win reliability of unicyclic and bicyclic graphs	0
Issue Information	0
A two‐stage network interdiction‐monitoring game	0
Traffic rate network tomography with higher‐order cumulants	0
Issue Information	0
Issue Information	0
A robust optimization framework for two‐echelon vehicle and UAV routing for post‐disaster humanitarian logistics operations	0
APPRECIATION TO REFEREES	0
	0
	0
The complexity of the timetable‐based railway network design problem	0
Algorithms and complexity for the almost equal maximum flow problem	0
Issue Information	0
Affine routing for robust network design	0
Network design with vulnerability constraints and probabilistic edge reliability	0
Issue Information	0
Heuristic reoptimization of time‐extended multi‐robot task allocation problems	0
Issue Information	0
On the complexity of the upgrading version of the maximal covering location problem	0
How vulnerable is an undirected planar graph with respect to max flow	0
Editorial: 2021 Glover‐Klingman Prize Winner	0
Issue Information	0
Issue Information	0
	0
New approximations for network reliability	0
Issue Information	0
Issue Information	0
A cops and robber game and the meeting time of synchronous directed walks	0
APPRECIATION TO REFEREES	0
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm	0
A continuous‐time service network design and vehicle routing problem	0
A demand‐responsive feeder service with a maximum headway at mandatory stops	0
Issue Information	0
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines	0
Topology reconstruction using time series data in telecommunication networks	0
Achieving feasibility for clustered traveling salesman problems using PQ‐trees	0
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs	0
The probabilistic uncapacitated open vehicle routing location problem	0
Valid inequalities and facets for multi‐module survivable network design problem	0
Issue Information	0
More reliable graphs are not always stronger	0
Exact solution approaches for the discrete α‐neighbor p‐center problem	0
Preface to the special issue on optimization in vehicle routing and logistics	0
	0
Issue Information	0
A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits	0
Issue Information	0
	0
Issue Information	0
Issue Information	0
Issue Information	0
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis	0
Issue Information	0
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty	0
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques	0
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts	0
Issue Information	0
A warehouse location‐allocation bilevel problem that considers inventory policies	0
	0
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters	0
Exact reliability optimization for series‐parallel graphs using convex envelopes	0
Mean‐standard deviation model for minimum cost flow problem	0
	0
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems	0
A survivable variant of the ring star problem	0
Issue Information	0
A hybrid genetic algorithm for the Hamiltonian p‐median problem	0
	0
Minimizing recovery cost of network optimization problems	0
Preface: Special issue on network analytics and optimization	0
Editorial	0
	0
Robust capacitated Steiner trees and networks with uniform demands	0
	0
Algorithmic solutions for maximizing shareable costs	0
Two‐stage stochastic one‐to‐many driver matching for ridesharing	0
A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem	0
Issue Information	0
	0
Preface	0
	0
	0