Networks

Article	Citations
Issue Information	38
Optimizing the ecological connectivity of landscapes	37
Issue Information	28
APPRECIATION TO REFEREES	22
	18
Issue Information	15
Issue Information	14
Approximation algorithms for Steiner forest: An experimental study	12
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation	11
Optimal hierarchical clustering on a graph	11
A combinatorial auction‐based approach for ridesharing in a student transportation system	10
	10
A survivable variant of the ring star problem	10
A continuous‐time service network design and vehicle routing problem	9
On maximum ratio clique relaxations	9
Grocery distribution plans in urban networks with street crossing penalties	8
Collaborative transportation for attended home deliveries	8
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	8
Fast reliability ranking of matchstick minimal networks	7
EETTlib—Energy‐efficient train timetabling library	6
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks	6
Fast upper and lower bounds for a large‐scale real‐world arc routing problem	6
Editorial	6
	5
Issue Information	5

The single robot line coverage problem: Theory, algorithms, and experiments	5
	5
	5
	5
	5
	4
Virtual network function reconfiguration in 5G networks: An optimization perspective	4
Balanced cable routing for offshore wind farms with obstacles	4
	4
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks	4
A cops and robber game and the meeting time of synchronous directed walks	3
Decision support for the technician routing and scheduling problem	3
The family traveling salesman problem with incompatibility constraints	3
The b‐bibranching problem: TDI system, packing, and discrete convexity	3
Cost‐optimal truck‐and‐robot routing for last‐mile delivery	3
Paths and flows for centrality measures in networks	3
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach	3
Optimal connected subgraphs: Integer programming formulations and polyhedra	3
	3
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs	3
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	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
Maximum flow‐based formulation for the optimal location of electric vehicle charging stations	3
	2
Issue Information	2
Algorithms and complexity for the almost equal maximum flow problem	2
	2
Network design with vulnerability constraints and probabilistic edge reliability	2
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem	2
	2
In search of dense subgraphs: How good is greedy peeling?	2
Issue Information	2
Issue Information	2
A robust optimization framework for two‐echelon vehicle and UAV routing for post‐disaster humanitarian logistics operations	2
	2
Maximum weight perfect matching problem with additional disjunctive conflict constraints	2
APPRECIATION TO REFEREES	2
Solving the routing and spectrum assignment problem, driven by combinatorial properties	2
Issue Information	2
An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints	2
Preface: Special issue on network analytics and optimization	1
Generalized nash fairness solutions for bi‐objective minimization problems	1
	1
Exact solution approaches for the discrete α‐neighbor p‐center problem	1
On matchings, T‐joins, and arc routing in road networks	1
Issue Information	1
Issue Information	1
Impact of knowledge on the cost of treasure hunt in trees	1
Issue Information	1

Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters	1
	1
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques	1
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	1
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem	1
A Multi‐Trip Vehicle Routing Problem With Release Dates and Interrelated Periods	1
Have a Good Travel Time in Routing: Bibliometric Analysis, Literature Review, and Future Directions	1
A warehouse location‐allocation bilevel problem that considers inventory policies	1
2019–2020 Glover‐Klingman Prize Winners	1
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques	1
Targeted multiobjective Dijkstra algorithm	1
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	1
Issue Information	1
Optimizing edge sets in networks to produce ground truth communities based on modularity	1
Two‐stage stochastic one‐to‐many driver matching for ridesharing	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
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	1
A multi‐vehicle covering tour problem with speed optimization	1
Affine routing for robust network design	1
New approximations for network reliability	1
	1
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	1
	1
The node cop‐win reliability of unicyclic and bicyclic graphs	1
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows	1
	1
Editorial: 2021 Glover‐Klingman Prize Winner	1
Issue Information	1
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts	1
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	1
	1
A dynamic programming algorithm for order picking in robotic mobile fulfillment systems	1
Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions	1
Multistage stochastic programming for integrated network optimization in hurricane relief logistics and evacuation planning	0
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem	0
Simplifying obstacles for Steiner network problems in the plane	0
More reliable graphs are not always stronger	0
Preprocessing for segment routing optimization	0
Issue Information	0
Risk‐averse optimization and resilient network flows	0
Selectively closing recycling centers in Bavaria: Reforming waste‐management policy to reduce disparity	0
Existence of optimally‐greatest digraphs for strongly connected node reliability	0
	0
A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem	0
Learning to repeatedly solve routing problems	0
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group	0
A two‐stage network interdiction‐monitoring game	0
Issue Information	0
Traffic rate network tomography with higher‐order cumulants	0
A flow‐based ascending auction to compute buyer‐optimal Walrasian prices	0
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs	0
Robust transshipment problem under consistent flow constraints	0
Parcel delivery cost minimization with time window constraints using trucks and drones	0
A genetic approach for the 2‐edge‐connected minimum branch vertices problem	0
Min‐sum controllable risk problems with concave risk functions of the same value range	0
Optimal deployment of indoor wireless local area networks	0
	0
Minimizing recovery cost of network optimization problems	0
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures	0
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints	0
	0
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals	0
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	0
A survey on optimization studies of group centrality metrics	0
Heuristic reoptimization of time‐extended multi‐robot task allocation problems	0
Balancing graph Voronoi diagrams with one more vertex	0
Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport	0
Semi‐labeled unrooted binary tree optimization subject to nonnegativity	0
Directions for future research on urban mobility and city logistics	0
Monte Carlo tree search for dynamic shortest‐path interdiction	0
Finding minimum label spanning trees using cross‐entropy method	0
A two‐tier urban delivery network with robot‐based deliveries	0
Preface: Special issue on freight transportation and logistics	0
Node based compact formulations for the Hamiltonian p‐median problem	0
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	0
Issue Information	0
An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network	0
Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques	0
Robust capacitated Steiner trees and networks with uniform demands	0

An improved hybrid genetic search with data mining for the CVRP	0
Issue Information	0
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem	0
Achieving feasibility for clustered traveling salesman problems using PQ‐trees	0
A new MILP formulation for the flying sidekick traveling salesman problem	0
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems	0
The time‐consistent dial‐a‐ride problem	0
A hybrid genetic algorithm for the Hamiltonian p‐median problem	0
Formulations and valid inequalities for the capacitated dispersion problem	0
Two extended formulations for the virtual network function placement and routing problem	0
Sub‐Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial‐Size Formulations	0
Constraint programming approaches for the discretizable molecular distance geometry problem	0
	0
Minimum k‐cores and the k‐core polytope	0
The k‐path vertex cover: General bounds and chordal graphs	0
A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs	0
Asymptotic bounds for clustering problems in random graphs	0
An exact algorithm for the service network design problem with hub capacity constraints	0
A metaheuristic algorithm for large maximum weight independent set problems	0
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements	0
	0
Issue Information	0
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem	0
The hazardous orienteering problem	0
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times	0
Issue Information	0
Reducing police response times: Optimization and simulation of everyday police patrol	0
A new linear path pair availability constraint for network design	0
The consistent production routing problem	0
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning	0
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application	0
Issue Information	0
Last‐mile delivery with drone and lockers	0
	0
	0
Enhanced methods for the weight constrained shortest path problem	0
Issue Information	0
	0
Three network design problems for community energy storage	0
Special issue of Networks: New network models and approaches for logistics and transportation	0
Network augmentation for disaster‐resilience against geographically correlated failure	0
Hybrid genetic algorithm for undirected traveling salesman problems with profits	0
Social classroom seating assignment problems	0
Valid inequalities and facets for multi‐module survivable network design problem	0
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks	0
The inventory routing problem with split deliveries	0
An Improved Freight Transportation Planning System for Less‐Than‐Truckload Operations of a Third‐Party Logistics Carrier	0
Issue Information	0
A novel pseudo‐polynomial approach for shortest path problems	0
	0
Variable neighborhood search approach with intensified shake for monitor placement	0
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis	0
Yield uncertainty and strategic formation of supply chain networks	0
Min–max optimization of node‐targeted attacks in service networks	0
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks	0
ILP‐based heuristics for a virtual network function placement and routing problem	0
The complexity of the timetable‐based railway network design problem	0
Capacity provisioning for evacuation on path networks	0
Issue Information	0
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	0
The multifacility center problems with random demand weights	0
Uniformly optimally reliable graphs: A survey	0
Optimal error‐detection system for identifying codes	0
Issue Information	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
Mobile parcel lockers with individual customer service	0
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots	0
A combinatorial branch and bound for the safe set problem	0
A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs	0
A tabu search with geometry‐based sparsification methods for angular traveling salesman problems	0
Finding conserved low‐diameter subgraphs in social and biological networks	0
	0
Issue Information	0
On the complexity of the bilevel minimum spanning tree problem	0
Getting linear time in graphs of bounded neighborhood diversity	0
Issue Information	0
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings	0
The probabilistic uncapacitated open vehicle routing location problem	0
Issue Information	0
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems	0
Connected graph partitioning with aggregated and non‐aggregated gap objective functions	0
Solving vehicle routing problems with intermediate stops using VRPSolver models	0
Efficient presolving methods for the influence maximization problem	0
Combinatorial acyclicity models for potential‐based flows	0
A demand‐responsive feeder service with a maximum headway at mandatory stops	0
	0
Issue Information	0
How vulnerable is an undirected planar graph with respect to max flow	0
Preface: Special issue on the future of city logistics and urban mobility	0
Algorithmic solutions for maximizing shareable costs	0
	0
Mean‐standard deviation model for minimum cost flow problem	0
The complexity landscape of disaster‐aware network extension problems	0
Continuous approximation formulas for location problems	0