Networks

Article	Citations
Issue Information	42
Optimizing the ecological connectivity of landscapes	22
Issue Information	15
APPRECIATION TO REFEREES	14
	13
Issue Information	13
	11
Issue Information	11
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	11
Approximation algorithms for Steiner forest: An experimental study	10
Issue Information	10
Optimal hierarchical clustering on a graph	10
	9
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation	9
A survivable variant of the ring star problem	8
Grocery distribution plans in urban networks with street crossing penalties	6
Balanced cable routing for offshore wind farms with obstacles	6
A continuous‐time service network design and vehicle routing problem	6
On maximum ratio clique relaxations	6
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks	5
	5
Fast reliability ranking of matchstick minimal networks	5
Collaborative transportation for attended home deliveries	5
Fast upper and lower bounds for a large‐scale real‐world arc routing problem	4
Issue Information	4

EETTlib—Energy‐efficient train timetabling library	4
The single robot line coverage problem: Theory, algorithms, and experiments	4
	4
Editorial	4
	4
	3
Optimal connected subgraphs: Integer programming formulations and polyhedra	3
Speeding Up the Solution of the Site and Power Assignment Problem in Wireless Networks	3
Paths and flows for centrality measures in networks	3
A combinatorial auction‐based approach for ridesharing in a student transportation system	3
A cops and robber game and the meeting time of synchronous directed walks	3
	3
An Exact‐Arithmetic Algorithm for Spanning Tree Modulus	3
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs	3
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach	3
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	3
	3
Virtual network function reconfiguration in 5G networks: An optimization perspective	3
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks	3
The multi‐purpose K‐drones general routing problem	3
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines	3
Decision support for the technician routing and scheduling problem	3
Avoiding Deadlocks via Weak Deadlock Sets	2
	2
Issue Information	2
Algorithms and complexity for the almost equal maximum flow problem	2
	2
Issue Information	2
Solving the routing and spectrum assignment problem, driven by combinatorial properties	2
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem	2
Maximum weight perfect matching problem with additional disjunctive conflict constraints	2
	2
Fiber‐To‐The‐Home Passive Optical Distribution Network Design: A New Formulation and Valid Inequalities Using Polar Duality	2
Modeling a Location and Routing Problem for Mobile Lockers in Last‐Mile Delivery With Horizontal Collaboration	2
Network design with vulnerability constraints and probabilistic edge reliability	2
Issue Information	2
	2
Issue Information	2
	2
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	2
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows	1
2019–2020 Glover‐Klingman Prize Winners	1
Impact of knowledge on the cost of treasure hunt in trees	1
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques	1
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques	1
Issue Information	1
Affine routing for robust network design	1
Targeted multiobjective Dijkstra algorithm	1
Maximum flow‐based formulation for the optimal location of electric vehicle charging stations	1
Issue Information	1

Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	1
Have a Good Travel Time in Routing: Bibliometric Analysis, Literature Review, and Future Directions	1
Two‐stage stochastic one‐to‐many driver matching for ridesharing	1
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters	1
	1
A robust optimization framework for two‐echelon vehicle and UAV routing for post‐disaster humanitarian logistics operations	1
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts	1
A dynamic programming algorithm for order picking in robotic mobile fulfillment systems	1
The node cop‐win reliability of unicyclic and bicyclic graphs	1
Optimizing edge sets in networks to produce ground truth communities based on modularity	1
	1
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers	1
The workforce scheduling and routing problem with park‐and‐loop	1
Generalized nash fairness solutions for bi‐objective minimization problems	1
A multi‐vehicle covering tour problem with speed optimization	1
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	1
Exact solution approaches for the discrete α‐neighbor p‐center problem	1
An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints	1
Editorial: 2021 Glover‐Klingman Prize Winner	1
New approximations for network reliability	1
	1
	1
Issue Information	1
Issue Information	1
The Minimum Clique Routing Problem on Cycles	1
Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions	1
	1
A Multi‐Trip Vehicle Routing Problem With Release Dates and Interrelated Periods	1
Hisom: Hierarchical Self‐Organizing Map for Solving Multiple Traveling Salesman Problems	1
	1
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	0
Efficient presolving methods for the influence maximization problem	0
Robust capacitated Steiner trees and networks with uniform demands	0
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements	0
Traffic rate network tomography with higher‐order cumulants	0
Asymptotic bounds for clustering problems in random graphs	0
Three network design problems for community energy storage	0
Matheuristic Algorithms for the Inventory Routing Problem With Unsplit and Split Deliveries	0
Issue Information	0
	0
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems	0
Optimal error‐detection system for identifying codes	0
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend	0
Solving vehicle routing problems with intermediate stops using VRPSolver models	0
The multifacility center problems with random demand weights	0
The k‐path vertex cover: General bounds and chordal graphs	0
A genetic approach for the 2‐edge‐connected minimum branch vertices problem	0
Sub‐Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial‐Size Formulations	0
Preface: Special issue on network analytics and optimization	0
On the complexity of the bilevel minimum spanning tree problem	0
A Fix‐And‐Optimize Matheuristic to Solve the Location‐Allocation of Vaccination Facilities: Case of Jalisco, Mexico	0
Finding conserved low‐diameter subgraphs in social and biological networks	0
Optimal deployment of indoor wireless local area networks	0
Min‐sum controllable risk problems with concave risk functions of the same value range	0
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals	0
Capacity provisioning for evacuation on path networks	0
Selectively closing recycling centers in Bavaria: Reforming waste‐management policy to reduce disparity	0
Issue Information	0
Issue Information	0
Combinatorial acyclicity models for potential‐based flows	0
The probabilistic uncapacitated open vehicle routing location problem	0
Last‐mile delivery with drone and lockers	0
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application	0
Issue Information	0
More reliable graphs are not always stronger	0
	0
A survey on optimization studies of group centrality metrics	0
On the complexity of the upgrading version of the maximal covering location problem	0
A new linear path pair availability constraint for network design	0
Shortest path network interdiction with asymmetric uncertainty	0
	0
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	0
The complexity landscape of disaster‐aware network extension problems	0
Getting linear time in graphs of bounded neighborhood diversity	0
The time‐consistent dial‐a‐ride problem	0
Monte Carlo tree search for dynamic shortest‐path interdiction	0
Risk‐averse optimization and resilient network flows	0
Valid inequalities and facets for multi‐module survivable network design problem	0
Multistage stochastic programming for integrated network optimization in hurricane relief logistics and evacuation planning	0
A flow‐based ascending auction to compute buyer‐optimal Walrasian prices	0

Issue Information	0
Constraint programming approaches for the discretizable molecular distance geometry problem	0
The complexity of the timetable‐based railway network design problem	0
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis	0
Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem	0
	0
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem	0
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm	0
A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem	0
Variable neighborhood search approach with intensified shake for monitor placement	0
Two extended formulations for the virtual network function placement and routing problem	0
Balancing graph Voronoi diagrams with one more vertex	0
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks	0
Uniformly optimally reliable graphs: A survey	0
	0
Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport	0
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks	0
A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs	0
An Improved Freight Transportation Planning System for Less‐Than‐Truckload Operations of a Third‐Party Logistics Carrier	0
A warehouse location‐allocation bilevel problem that considers inventory policies	0
Minimum k‐cores and the k‐core polytope	0
Issue Information	0
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs	0
Improving a constructive heuristic for the general routing problem	0
The hazardous orienteering problem	0
Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation	0
Preface: Special issue on the future of city logistics and urban mobility	0
A combinatorial branch and bound for the safe set problem	0
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	0
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints	0
Finding minimum label spanning trees using cross‐entropy method	0
	0
Connected graph partitioning with aggregated and non‐aggregated gap objective functions	0
An improved hybrid genetic search with data mining for the CVRP	0
Topology reconstruction using time series data in telecommunication networks	0
	0
Issue Information	0
Min–max optimization of node‐targeted attacks in service networks	0
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem	0
Learning to repeatedly solve routing problems	0
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times	0
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem	0
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	0
Simplifying obstacles for Steiner network problems in the plane	0
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning	0
	0
Algorithmic solutions for maximizing shareable costs	0
	0
Mean‐standard deviation model for minimum cost flow problem	0
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group	0
Hybrid genetic algorithm for undirected traveling salesman problems with profits	0
Achieving feasibility for clustered traveling salesman problems using PQ‐trees	0
Issue Information	0
Continuous approximation formulas for location problems	0
Network augmentation for disaster‐resilience against geographically correlated failure	0
Robust transshipment problem under consistent flow constraints	0
The inventory routing problem with split deliveries	0
A new MILP formulation for the flying sidekick traveling salesman problem	0
A simple proof of the Gross‐Saccoman multigraph conjecture	0
	0
ILP‐based heuristics for a virtual network function placement and routing problem	0
Issue Information	0
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots	0
Existence of optimally‐greatest digraphs for strongly connected node reliability	0
	0
Enhanced methods for the weight constrained shortest path problem	0
Social classroom seating assignment problems	0
A metaheuristic algorithm for large maximum weight independent set problems	0
A two‐stage network interdiction‐monitoring game	0
An integrated user‐system approach for shelter location and evacuation routing	0
A hybrid genetic algorithm for the Hamiltonian p‐median problem	0
Issue Information	0
Issue Information	0
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures	0
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems	0
	0
Mobile parcel lockers with individual customer service	0
	0
Issue Information	0
Special issue of Networks: New network models and approaches for logistics and transportation	0
Issue Information	0
Directions for future research on urban mobility and city logistics	0
The consistent production routing problem	0
A compact formulation for the base station deployment problem in wireless networks	0
Preface: Special issue on freight transportation and logistics	0
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty	0
Node based compact formulations for the Hamiltonian p‐median problem	0
Heuristic reoptimization of time‐extended multi‐robot task allocation problems	0
Formulations and valid inequalities for the capacitated dispersion problem	0
Semi‐labeled unrooted binary tree optimization subject to nonnegativity	0
Preprocessing for segment routing optimization	0
The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value	0
Yield uncertainty and strategic formation of supply chain networks	0
How vulnerable is an undirected planar graph with respect to max flow	0
A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs	0