Networks

Article	Citations
	33
	22
A survivable variant of the ring star problem	21
A continuous‐time service network design and vehicle routing problem	19
A cops and robber game and the meeting time of synchronous directed walks	19
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	17
A Chance‐Constrained Model for a Production Routing Problem With Uncertain Availability of Vehicles	16
On Combining Conventional Point‐To‐Point and Automated Waste Collection Systems	13
Digging Deep: Dynamic Programming for Optimal Routing With Double‐Deep Autonomous Mobile Robot Picking	13
	12
The Minimum Clique Routing Problem on Cycles	11
A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem	11
Primal‐Dual Bicriteria Approximation for A Constrained Prize‐Collecting Steiner Tree Problem	9
Issue Information	9
Targeted multiobjective Dijkstra algorithm	9
Perfect Matching Under Precedence Constraints	9
A warehouse location‐allocation bilevel problem that considers inventory policies	8
The cumulative school bus routing problem: Polynomial‐size formulations	8
Issue Information	8
The complexity of the timetable‐based railway network design problem	8
Extending the Inventory Routing Problem to Support Integrated Decision‐Making in an Urban Distribution Network	8
Ordered Median Traveling Salesman Problem	8
Mixed‐Integer Linear Programming Approaches for Nested p$$ p $$‐Center Problems With Absolute and Relative Regret Objectives	8
Issue Information	8
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals	7

A demand‐responsive feeder service with a maximum headway at mandatory stops	7
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm	7
	7
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	7
	7
Investigating Mixed‐Integer Programming Approaches for the p‐α‐Closest‐Center Problem	6
Issue Information	6
Issue Information	6
A metaheuristic algorithm for large maximum weight independent set problems	6
A genetic approach for the 2‐edge‐connected minimum branch vertices problem	6
The complexity landscape of disaster‐aware network extension problems	6
A new MILP formulation for the flying sidekick traveling salesman problem	6
Precedence‐Constrained Shortest Path	6
Existence of optimally‐greatest digraphs for strongly connected node reliability	6
Issue Information	6
Issue Information	5
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method	5
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction	5
Issue Information	5
Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport	5
	5
Monte Carlo tree search for dynamic shortest‐path interdiction	4
Multi‐Objective Route Optimization for Drone Deliveries Integrated With Public Transportation	4
Exact Solutions for the Moving Firefighter Problem on Trees	4
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	4
Maximum weight perfect matching problem with additional disjunctive conflict constraints	4
Traffic rate network tomography with higher‐order cumulants	4
Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem	4
Solving the routing and spectrum assignment problem, driven by combinatorial properties	4
Generalized nash fairness solutions for bi‐objective minimization problems	4
	4
New approximations for network reliability	4
Robust capacitated Steiner trees and networks with uniform demands	4
	4
Algorithms and complexity for the almost equal maximum flow problem	4
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	4
Algorithmic solutions for maximizing shareable costs	3
The inventory routing problem with split deliveries	3
A hybrid genetic algorithm for the Hamiltonian p‐median problem	3
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning	3
A tabu search with geometry‐based sparsification methods for angular traveling salesman problems	3
Balancing graph Voronoi diagrams with one more vertex	3
Consistent Collaborative Vehicle Utilization	3
Network augmentation for disaster‐resilience against geographically correlated failure	3
Collaborative Vehicle–Drone Routing for Fresh Product First‐Mile Pickup in E‐Commerce Environment	3
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	3
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm	3
An exact algorithm for the service network design problem with hub capacity constraints	3
Optimal error‐detection system for identifying codes	3
On the split reliability of graphs	3

Issue Information	3
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	3
Issue Information	3
Self‐Service and Home Delivery Combined: Coordinating the Route of a Mobile Parcel Locker With the Delivery Tasks of Its Human Driver	3
	3
A new linear path pair availability constraint for network design	3
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines	2
	2
Issue Information	2
Branch‐and‐Bound Algorithms for the K$$ K $$‐Cluster Problem Based on SDP Bounds Evaluated by Lagrangian Relaxation	2
An Exact Algorithm for the Hazardous Orienteering Problem	2
Variable neighborhood search approach with intensified shake for monitor placement	2
Complexity Results for a Cops and Robber Game on Directed Graphs	2
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters	2
A Dynamic Capacitated Facility Location Problem With Modular Capacities and Best Service Assignment: A Comparison of Formulations	2
A Hierarchical Divide‐and‐Conquer Neural Approach for Multiple Traveling Salesman Problems	2
	2
	2
Capacitated Vehicle Routing Problem with a Zone Tariff	2
Editorial	2
Energy Optimization Models for the Locomotive Assignment Problem	2
Preprocessing for segment routing optimization	2
Underground Freight Transportation for Package Delivery in Urban Environments	2
On the Complexity of the Bilevel Shortest Path Problem	2
The multi‐purpose K‐drones general routing problem	2
A Multi‐Trip Vehicle Routing Problem With Release Dates and Interrelated Periods	2
Scenario‐Based Platoon Lane Network Design	2
	2
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs	2
	2
An A‐Priori‐Splitting‐Based Heuristic for the Split Delivery Vehicle Routing Problem With Time Windows	2
A Fix‐And‐Optimize Matheuristic to Solve the Location‐Allocation of Vaccination Facilities: Case of Jalisco, Mexico	2
Issue Information	2
Yield uncertainty and strategic formation of supply chain networks	2
Issue Information	2
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques	2
Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions	2
Issue Information	2
Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems	1
Large‐Scale Mobility On‐Demand System With Shared Autonomous Electric Vehicles	1
Assessing the Impact of Driver Overtime in the Distribution Network of a Flower Retail Chain	1
Interdiction Models and Heuristics for Graph Propagation	1
The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value	1
A Clustering Approach for NSGA ‐ II in Political Redistricting	1
Asymptotic bounds for clustering problems in random graphs	1
Min–max optimization of node‐targeted attacks in service networks	1
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs	1
Issue Information	1
An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations	1
The Orienteering Problem With Heterogeneous Drones	1
Issue Information	1
Heuristic reoptimization of time‐extended multi‐robot task allocation problems	1
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots	1
	1
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements	1
	1
Finding the Maximum Subgraph of Prescribed Strength	1
A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem	1
Achieving feasibility for clustered traveling salesman problems using PQ‐trees	1
Issue Information	1
Hybrid genetic algorithm for undirected traveling salesman problems with profits	1
Finding conserved low‐diameter subgraphs in social and biological networks	1
Issue Information	0
A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs	0
Vehicle Routing Problem With Time Windows—New Valid Inequalities From Polar Duality	0
	0
Multi‐Stage Network Interdiction With Decision‐Dependent Success: Scenario Clustering and Reformulation Techniques	0
A survey on optimization studies of group centrality metrics	0
Exact Methods for the Split Delivery Vehicle Routing Problem With Two‐Dimensional Loading Constraints	0
Optimizing the ecological connectivity of landscapes	0
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem	0
Efficient presolving methods for the influence maximization problem	0
The hazardous orienteering problem	0
Multistage stochastic programming for integrated network optimization in hurricane relief logistics and evacuation planning	0
	0
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group	0
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem	0
Enhanced methods for the weight constrained shortest path problem	0
On the Multi‐Commodity Flow With Convex Objective Function: Column‐Generation Approaches	0
Reducing police response times: Optimization and simulation of everyday police patrol	0

Issue Information	0
Fiber‐To‐The‐Home Passive Optical Distribution Network Design: A New Formulation and Valid Inequalities Using Polar Duality	0
Mobile parcel lockers with individual customer service	0
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem	0
Avoiding Deadlocks via Weak Deadlock Sets	0
The Dynamic Rail‐Road Dial‐A‐Ride Problem	0
Social classroom seating assignment problems	0
Issue Information	0
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes	0
Connected graph partitioning with aggregated and non‐aggregated gap objective functions	0
Two extended formulations for the virtual network function placement and routing problem	0
Exploring Roadside Management Optimisation Opportunities: A Systematic Review on Arc Routing Problems Applications and Modelling	0
Maximum flow‐based formulation for the optimal location of electric vehicle charging stations	0
	0
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	0
A two‐stage network interdiction‐monitoring game	0
Picking Operations in Warehouses With Dynamically Arriving Orders: How Good is Reoptimization?	0
	0
Minimizing recovery cost of network optimization problems	0
Issue Information	0
Collaborative transportation for attended home deliveries	0
How vulnerable is an undirected planar graph with respect to max flow	0
Vertex covering with capacitated trees	0
Formulations and valid inequalities for the capacitated dispersion problem	0
Partial‐Outsourcing Strategy for the Vehicle Routing Problem With Stochastic Demands	0
The workforce scheduling and routing problem with park‐and‐loop	0
An improved hybrid genetic search with data mining for the CVRP	0
An Improved Freight Transportation Planning System for Less‐Than‐Truckload Operations of a Third‐Party Logistics Carrier	0
	0
Edge Coloring of Multigraphs With Very High Multiplicities	0
	0
Issue Information	0
Issue Information	0
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty	0
A compact formulation for the base station deployment problem in wireless networks	0
Issue Information	0
A Branch‐and‐Price Algorithm for the Symmetric Electric Traveling Salesman Problem	0
The probabilistic uncapacitated open vehicle routing location problem	0
Issue Information	0
Issue Information	0
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis	0
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	0
Tractable but Hard to Approximate: The Bi‐Objective Minimum s‐t‐Cut Problem With Binary Capacities	0
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques	0
A Heavy‐Duty Vehicle Routing Problem With Temperature Constraints	0
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks	0
Decision support for the technician routing and scheduling problem	0
	0
Shortest path network interdiction with asymmetric uncertainty	0
Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation	0
	0
A robust optimization framework for two‐echelon vehicle and UAV routing for post‐disaster humanitarian logistics operations	0
Issue Information	0
	0
Last‐mile delivery with drone and lockers	0
Issue Information	0
Sub‐Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial‐Size Formulations	0
Robustness Assessment of Public Transport Networks in Various Graph Representations: Systematic Review, Decision Support, and Case Study	0
A combinatorial branch and bound for the safe set problem	0
Solving vehicle routing problems with intermediate stops using VRPSolver models	0
Shaping Decision Models for Stochastic Dynamic Optimization Problems via Reinforcement Learning	0
Risk‐averse optimization and resilient network flows	0
	0
More reliable graphs are not always stronger	0
Speeding‐Up Graph Algorithms via Clique Partitioning	0
Selectively closing recycling centers in Bavaria: Reforming waste‐management policy to reduce disparity	0
A Graph‐Based Diverse Trajectory‐Driven Attention Model for Vehicle Routing Problems	0
A New Formulation for the Traveling Salesman Problem With Drone and Lockers	0
Getting linear time in graphs of bounded neighborhood diversity	0
Topology reconstruction using time series data in telecommunication networks	0
	0
	0
Dispatching, Positioning and Routing Resources for Wildfire Initial Attack	0
Two‐stage stochastic one‐to‐many driver matching for ridesharing	0
Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem	0
Hisom: Hierarchical Self‐Organizing Map for Solving Multiple Traveling Salesman Problems	0
Issue Information	0
	0
Mean‐standard deviation model for minimum cost flow problem	0
On the complexity of the upgrading version of the maximal covering location problem	0
An Exact Method for Reliable Shortest Path Problems With Correlation	0
Virtual network function reconfiguration in 5G networks: An optimization perspective	0
Valid inequalities and facets for multi‐module survivable network design problem	0
A flow‐based ascending auction to compute buyer‐optimal Walrasian prices	0
Speeding Up the Solution of the Site and Power Assignment Problem in Wireless Networks	0
Optimizing Household Waste Recycling Centre Network Reorganization in Hampshire	0
Issue Information	0
Minimum‐Peak‐Cost Flows Over Time	0
Three network design problems for community energy storage	0
Exact solution approaches for the discrete α‐neighbor p‐center problem	0
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks	0
	0
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times	0
A Lasso‐Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks	0
An Extended Formulation With Valid Inequalities for the Capacitated Steiner Arborescence Problem	0