Networks

Article	Citations
Issue Information	31
A cops and robber game and the meeting time of synchronous directed walks	23
	19
A survivable variant of the ring star problem	17
A continuous‐time service network design and vehicle routing problem	15
On Combining Conventional Point‐To‐Point and Automated Waste Collection Systems	13
A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem	12
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	12
	12
The Minimum Clique Routing Problem on Cycles	12
Balanced cable routing for offshore wind farms with obstacles	12
Targeted multiobjective Dijkstra algorithm	11
A warehouse location‐allocation bilevel problem that considers inventory policies	9
Mixed‐Integer Linear Programming Approaches for Nested p$$ p $$‐Center Problems With Absolute and Relative Regret Objectives	8
The complexity of the timetable‐based railway network design problem	8
Uniformly optimally reliable graphs: A survey	8
Issue Information	7
The cumulative school bus routing problem: Polynomial‐size formulations	7
Issue Information	7
Issue Information	7
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm	7
	6
A demand‐responsive feeder service with a maximum headway at mandatory stops	6
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals	6
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	6

Minimum k‐cores and the k‐core polytope	5
Existence of optimally‐greatest digraphs for strongly connected node reliability	5
Issue Information	5
Issue Information	5
A genetic approach for the 2‐edge‐connected minimum branch vertices problem	5
A metaheuristic algorithm for large maximum weight independent set problems	5
Precedence‐Constrained Shortest Path	5
	5
The complexity landscape of disaster‐aware network extension problems	5
A new MILP formulation for the flying sidekick traveling salesman problem	5
	4
Issue Information	4
Issue Information	4
Issue Information	4
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	4
Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport	4
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method	4
Maximum weight perfect matching problem with additional disjunctive conflict constraints	3
New approximations for network reliability	3
Traffic rate network tomography with higher‐order cumulants	3
Algorithmic solutions for maximizing shareable costs	3
A hybrid genetic algorithm for the Hamiltonian p‐median problem	3
	3
Algorithms and complexity for the almost equal maximum flow problem	3
Solving the routing and spectrum assignment problem, driven by combinatorial properties	3
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	3
Robust capacitated Steiner trees and networks with uniform demands	3
The inventory routing problem with split deliveries	3
On the split reliability of graphs	3
	3
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	3
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	3
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks	3
Monte Carlo tree search for dynamic shortest‐path interdiction	3
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	3
Network augmentation for disaster‐resilience against geographically correlated failure	3
Continuous approximation formulas for location problems	3
	3
Generalized nash fairness solutions for bi‐objective minimization problems	3
Balancing graph Voronoi diagrams with one more vertex	2
A simple proof of the Gross‐Saccoman multigraph conjecture	2
An exact algorithm for the service network design problem with hub capacity constraints	2
A new linear path pair availability constraint for network design	2
Variable neighborhood search approach with intensified shake for monitor placement	2
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines	2
	2
Preprocessing for segment routing optimization	2
Issue Information	2
Directions for future research on urban mobility and city logistics	2
Yield uncertainty and strategic formation of supply chain networks	2

Optimal deployment of indoor wireless local area networks	2
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning	2
	2
A Fix‐And‐Optimize Matheuristic to Solve the Location‐Allocation of Vaccination Facilities: Case of Jalisco, Mexico	2
Complexity Results for a Cops and Robber Game on Directed Graphs	2
Editorial	2
Issue Information	2
Underground Freight Transportation for Package Delivery in Urban Environments	2
Semi‐labeled unrooted binary tree optimization subject to nonnegativity	2
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm	2
A tabu search with geometry‐based sparsification methods for angular traveling salesman problems	2
An Exact Algorithm for the Hazardous Orienteering Problem	2
Optimal error‐detection system for identifying codes	2
	2
Paths and flows for centrality measures in networks	2
Branch‐and‐Bound Algorithms for the K$$ K $$‐Cluster Problem Based on SDP Bounds Evaluated by Lagrangian Relaxation	2
Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions	1
An A‐Priori‐Splitting‐Based Heuristic for the Split Delivery Vehicle Routing Problem With Time Windows	1
An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations	1
	1
Issue Information	1
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group	1
	1
Heuristic reoptimization of time‐extended multi‐robot task allocation problems	1
Two extended formulations for the virtual network function placement and routing problem	1
Issue Information	1
	1
Achieving feasibility for clustered traveling salesman problems using PQ‐trees	1
Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems	1
Issue Information	1
	1
On the Complexity of the Bilevel Shortest Path Problem	1
A Multi‐Trip Vehicle Routing Problem With Release Dates and Interrelated Periods	1
Issue Information	1
Virtual network function reconfiguration in 5G networks: An optimization perspective	1
Min–max optimization of node‐targeted attacks in service networks	1
On the complexity of the bilevel minimum spanning tree problem	1
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints	1
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots	1
Optimizing edge sets in networks to produce ground truth communities based on modularity	1
Hybrid genetic algorithm for undirected traveling salesman problems with profits	1
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems	1
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs	1
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques	1
Issue Information	1
The multi‐purpose K‐drones general routing problem	1
Exact reliability optimization for series‐parallel graphs using convex envelopes	1
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements	1
Speeding Up the Solution of the Site and Power Assignment Problem in Wireless Networks	1
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements	1
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks	1
A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem	1
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend	1
The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value	1
Finding conserved low‐diameter subgraphs in social and biological networks	1
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters	1
Asymptotic bounds for clustering problems in random graphs	1
Social classroom seating assignment problems	0
Vertex covering with capacitated trees	0
Risk‐averse optimization and resilient network flows	0
Issue Information	0
Issue Information	0
Learning to repeatedly solve routing problems	0
Solving vehicle routing problems with intermediate stops using VRPSolver models	0
An improved hybrid genetic search with data mining for the CVRP	0
More reliable graphs are not always stronger	0
Last‐mile delivery with drone and lockers	0
Issue Information	0
Formulations and valid inequalities for the capacitated dispersion problem	0
Issue Information	0
A combinatorial branch and bound for the safe set problem	0
	0
Issue Information	0
The Robust Vehicle Routing Problem With Synchronization: Models and Branch‐And‐Cut Algorithms	0
	0
A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs	0
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	0
A New Formulation for the Traveling Salesman Problem With Drone and Lockers	0
Issue Information	0
Shortest path network interdiction with asymmetric uncertainty	0

Hisom: Hierarchical Self‐Organizing Map for Solving Multiple Traveling Salesman Problems	0
Issue Information	0
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes	0
Issue Information	0
	0
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis	0
Minimum‐Peak‐Cost Flows Over Time	0
	0
Reducing police response times: Optimization and simulation of everyday police patrol	0
Stability of Interdiction Strategies in Quickest Flow Networks	0
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks	0
Issue Information	0
Topology reconstruction using time series data in telecommunication networks	0
How vulnerable is an undirected planar graph with respect to max flow	0
A Heavy‐Duty Vehicle Routing Problem With Temperature Constraints	0
Minimizing recovery cost of network optimization problems	0
On the complexity of the upgrading version of the maximal covering location problem	0
Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem	0
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times	0
Issue Information	0
Issue Information	0
Enhanced methods for the weight constrained shortest path problem	0
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem	0
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem	0
Matheuristic Algorithms for the Inventory Routing Problem With Unsplit and Split Deliveries	0
Integrality in the multinetwork min‐cost equal‐flow problem	0
	0
Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques	0
Preface: Special issue on the future of city logistics and urban mobility	0
A Resilient Variant of the Ring Star Problem	0
Two‐stage stochastic one‐to‐many driver matching for ridesharing	0
Multistage stochastic programming for integrated network optimization in hurricane relief logistics and evacuation planning	0
Robust transshipment problem under consistent flow constraints	0
Optimizing the ecological connectivity of landscapes	0
	0
An Improved Freight Transportation Planning System for Less‐Than‐Truckload Operations of a Third‐Party Logistics Carrier	0
Issue Information	0
	0
	0
A compact formulation for the base station deployment problem in wireless networks	0
Fiber‐To‐The‐Home Passive Optical Distribution Network Design: A New Formulation and Valid Inequalities Using Polar Duality	0
	0
Valid inequalities and facets for multi‐module survivable network design problem	0
A robust optimization framework for two‐echelon vehicle and UAV routing for post‐disaster humanitarian logistics operations	0
Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation	0
Mobile parcel lockers with individual customer service	0
Modeling a Location and Routing Problem for Mobile Lockers in Last‐Mile Delivery With Horizontal Collaboration	0
Connected graph partitioning with aggregated and non‐aggregated gap objective functions	0
Three network design problems for community energy storage	0
A two‐stage network interdiction‐monitoring game	0
	0
Maximum flow‐based formulation for the optimal location of electric vehicle charging stations	0
	0
Improving a constructive heuristic for the general routing problem	0
	0
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem	0
A survey on optimization studies of group centrality metrics	0
	0
	0
Capacity provisioning for evacuation on path networks	0
Vehicle Routing Problem With Time Windows—New Valid Inequalities From Polar Duality	0
	0
Efficient presolving methods for the influence maximization problem	0
Multi‐Stage Network Interdiction With Decision‐Dependent Success: Scenario Clustering and Reformulation Techniques	0
Picking Operations in Warehouses With Dynamically Arriving Orders: How Good is Reoptimization?	0
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application	0
Getting linear time in graphs of bounded neighborhood diversity	0
Exact solution approaches for the discrete α‐neighbor p‐center problem	0
A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs	0
Exact Methods for the Split Delivery Vehicle Routing Problem With Two‐Dimensional Loading Constraints	0
Issue Information	0
Collaborative transportation for attended home deliveries	0
Selectively closing recycling centers in Bavaria: Reforming waste‐management policy to reduce disparity	0
Decision support for the technician routing and scheduling problem	0
	0
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty	0
The hazardous orienteering problem	0
Editorial: 2021 Glover‐Klingman Prize Winner	0
APPRECIATION TO REFEREES	0
Issue Information	0
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem	0
Avoiding Deadlocks via Weak Deadlock Sets	0
Issue Information	0
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques	0
The consistent production routing problem	0
Mean‐standard deviation model for minimum cost flow problem	0
The probabilistic uncapacitated open vehicle routing location problem	0
A Cost Function Approximation Based Large Neighborhood Search for Dynamic Medical Courier Services	0
A flow‐based ascending auction to compute buyer‐optimal Walrasian prices	0
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	0
Dispatching, Positioning and Routing Resources for Wildfire Initial Attack	0
	0
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	0
Sub‐Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial‐Size Formulations	0
Issue Information	0