Networks

Article	Citations
Issue Information	29
	20
Balanced cable routing for offshore wind farms with obstacles	16
A combinatorial auction‐based approach for ridesharing in a student transportation system	14
A cops and robber game and the meeting time of synchronous directed walks	14
A survivable variant of the ring star problem	13
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	11
	11
On Combining Conventional Point‐To‐Point and Automated Waste Collection Systems	11
A continuous‐time service network design and vehicle routing problem	11
A warehouse location‐allocation bilevel problem that considers inventory policies	10
Targeted multiobjective Dijkstra algorithm	10
The Minimum Clique Routing Problem on Cycles	10
The complexity of the timetable‐based railway network design problem	9
Affine routing for robust network design	9
Uniformly optimally reliable graphs: A survey	8
Issue Information	8
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm	8
Issue Information	7
Issue Information	7
A demand‐responsive feeder service with a maximum headway at mandatory stops	6
	6
The cumulative school bus routing problem: Polynomial‐size formulations	6
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	6
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals	6

A new MILP formulation for the flying sidekick traveling salesman problem	5
A metaheuristic algorithm for large maximum weight independent set problems	5
The complexity landscape of disaster‐aware network extension problems	5
	5
Minimum k‐cores and the k‐core polytope	4
A genetic approach for the 2‐edge‐connected minimum branch vertices problem	4
Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport	4
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures	4
	4
Issue Information	4
Existence of optimally‐greatest digraphs for strongly connected node reliability	4
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems	4
Issue Information	4
Algorithmic solutions for maximizing shareable costs	3
Solving the routing and spectrum assignment problem, driven by combinatorial properties	3
Grocery distribution plans in urban networks with street crossing penalties	3
	3
Generalized nash fairness solutions for bi‐objective minimization problems	3
New approximations for network reliability	3
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	3
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	3
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks	3
	3
Maximum weight perfect matching problem with additional disjunctive conflict constraints	3
Monte Carlo tree search for dynamic shortest‐path interdiction	3
Algorithms and complexity for the almost equal maximum flow problem	3
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	3
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	3
Issue Information	3
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	3
The inventory routing problem with split deliveries	2
Robust capacitated Steiner trees and networks with uniform demands	2
A hybrid genetic algorithm for the Hamiltonian p‐median problem	2
An Exact Algorithm for the Hazardous Orienteering Problem	2
Preprocessing for segment routing optimization	2
Variable neighborhood search approach with intensified shake for monitor placement	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 practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning	2
Network augmentation for disaster‐resilience against geographically correlated failure	2
Traffic rate network tomography with higher‐order cumulants	2
	2
A Fix‐And‐Optimize Matheuristic to Solve the Location‐Allocation of Vaccination Facilities: Case of Jalisco, Mexico	2
Directions for future research on urban mobility and city logistics	2
Yield uncertainty and strategic formation of supply chain networks	2
A new linear path pair availability constraint for network design	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
Continuous approximation formulas for location problems	2
On the split reliability of graphs	2

Agile optimization for a real‐time facility location problem in Internet of Vehicles networks	2
Optimal error‐detection system for identifying codes	2
Balancing graph Voronoi diagrams with one more vertex	2
Semi‐labeled unrooted binary tree optimization subject to nonnegativity	2
Optimal deployment of indoor wireless local area networks	2
Fast reliability ranking of matchstick minimal networks	1
	1
Editorial	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
On the complexity of the bilevel minimum spanning tree problem	1
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots	1
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements	1
Issue Information	1
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques	1
Exact reliability optimization for series‐parallel graphs using convex envelopes	1
A Multi‐Trip Vehicle Routing Problem With Release Dates and Interrelated Periods	1
	1
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines	1
Issue Information	1
The multi‐purpose K‐drones general routing problem	1
The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value	1
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group	1
	1
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend	1
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs	1
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems	1
Achieving feasibility for clustered traveling salesman problems using PQ‐trees	1
Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions	1
Issue Information	1
Issue Information	1
Paths and flows for centrality measures in networks	1
Complexity Results for a Cops and Robber Game on Directed Graphs	1
Heuristic reoptimization of time‐extended multi‐robot task allocation problems	1
A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem	1
Optimizing edge sets in networks to produce ground truth communities based on modularity	1
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements	1
Hybrid genetic algorithm for undirected traveling salesman problems with profits	1
Min–max optimization of node‐targeted attacks in service networks	1
Issue Information	1
	1
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints	1
Issue Information	1
Finding conserved low‐diameter subgraphs in social and biological networks	1
	1
Integrality in the multinetwork min‐cost equal‐flow problem	0
Issue Information	0
Issue Information	0
Dispatching, Positioning and Routing Resources for Wildfire Initial Attack	0
	0
Special issue of Networks: New network models and approaches for logistics and transportation	0
A Resilient Variant of the Ring Star Problem	0
The hazardous orienteering problem	0
Simplifying obstacles for Steiner network problems in the plane	0
The time‐consistent dial‐a‐ride problem	0
The workforce scheduling and routing problem with park‐and‐loop	0
Multistage stochastic programming for integrated network optimization in hurricane relief logistics and evacuation planning	0
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries	0
A New Formulation for the Traveling Salesman Problem With Drone and Lockers	0
Network design with vulnerability constraints and probabilistic edge reliability	0
Formulations and valid inequalities for the capacitated dispersion problem	0
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times	0
Issue Information	0
Risk‐averse optimization and resilient network flows	0
Issue Information	0
Issue Information	0
Hisom: Hierarchical Self‐Organizing Map for Solving Multiple Traveling Salesman Problems	0
Issue Information	0
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	0
	0
Fiber‐To‐The‐Home Passive Optical Distribution Network Design: A New Formulation and Valid Inequalities Using Polar Duality	0
Two‐stage stochastic one‐to‐many driver matching for ridesharing	0
Avoiding Deadlocks via Weak Deadlock Sets	0
Enhanced methods for the weight constrained shortest path problem	0
Decision support for the technician routing and scheduling problem	0
Issue Information	0
Reducing police response times: Optimization and simulation of everyday police patrol	0
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks	0
Connected graph partitioning with aggregated and non‐aggregated gap objective functions	0
Issue Information	0

Issue Information	0
Last‐mile delivery with drone and lockers	0
A compact formulation for the base station deployment problem in wireless networks	0
Modeling a Location and Routing Problem for Mobile Lockers in Last‐Mile Delivery With Horizontal Collaboration	0
Virtual network function reconfiguration in 5G networks: An optimization perspective	0
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty	0
Valid inequalities and facets for multi‐module survivable network design problem	0
Solving vehicle routing problems with intermediate stops using VRPSolver models	0
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem	0
More reliable graphs are not always stronger	0
Issue Information	0
	0
	0
Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation	0
A flow‐based ascending auction to compute buyer‐optimal Walrasian prices	0
	0
Selectively closing recycling centers in Bavaria: Reforming waste‐management policy to reduce disparity	0
Capacity provisioning for evacuation on path networks	0
Exact solution approaches for the discrete α‐neighbor p‐center problem	0
2019–2020 Glover‐Klingman Prize Winners	0
Improving a constructive heuristic for the general routing problem	0
A survey on optimization studies of group centrality metrics	0
	0
Preface: Special issue on the future of city logistics and urban mobility	0
Sub‐Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial‐Size Formulations	0
	0
An improved hybrid genetic search with data mining for the CVRP	0
	0
Three network design problems for community energy storage	0
	0
Editorial: 2021 Glover‐Klingman Prize Winner	0
A robust optimization framework for two‐echelon vehicle and UAV routing for post‐disaster humanitarian logistics operations	0
A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs	0
APPRECIATION TO REFEREES	0
	0
	0
Issue Information	0
Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem	0
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	0
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem	0
On the complexity of the upgrading version of the maximal covering location problem	0
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach	0
Maximum flow‐based formulation for the optimal location of electric vehicle charging stations	0
Issue Information	0
Node based compact formulations for the Hamiltonian p‐median problem	0
Two extended formulations for the virtual network function placement and routing problem	0
	0
Mobile parcel lockers with individual customer service	0
Have a Good Travel Time in Routing: Bibliometric Analysis, Literature Review, and Future Directions	0
Getting linear time in graphs of bounded neighborhood diversity	0
Issue Information	0
	0
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings	0
Learning to repeatedly solve routing problems	0
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks	0
	0
How vulnerable is an undirected planar graph with respect to max flow	0
ILP‐based heuristics for a virtual network function placement and routing problem	0
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application	0
Constraint programming approaches for the discretizable molecular distance geometry problem	0
A dynamic programming algorithm for order picking in robotic mobile fulfillment systems	0
An Improved Freight Transportation Planning System for Less‐Than‐Truckload Operations of a Third‐Party Logistics Carrier	0
Vertex covering with capacitated trees	0
Collaborative transportation for attended home deliveries	0
Impact of knowledge on the cost of treasure hunt in trees	0
Issue Information	0
	0
Issue Information	0
Issue Information	0
Minimizing recovery cost of network optimization problems	0
	0
Efficient presolving methods for the influence maximization problem	0
	0
Mean‐standard deviation model for minimum cost flow problem	0
Optimizing the ecological connectivity of landscapes	0
Issue Information	0
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes	0
The consistent production routing problem	0
Issue Information	0
	0
Social classroom seating assignment problems	0
A two‐stage network interdiction‐monitoring game	0
A combinatorial branch and bound for the safe set problem	0
Speeding Up the Solution of the Site and Power Assignment Problem in Wireless Networks	0
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	0
Topology reconstruction using time series data in telecommunication networks	0
	0
Picking Operations in Warehouses With Dynamically Arriving Orders: How Good is Reoptimization?	0
The probabilistic uncapacitated open vehicle routing location problem	0
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem	0
The multifacility center problems with random demand weights	0
Shortest path network interdiction with asymmetric uncertainty	0
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques	0
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem	0
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis	0