Networks

Papers
(The median citation count of Networks is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-11-01 to 2024-11-01.)
ArticleCitations
Cost‐optimal truck‐and‐robot routing for last‐mile delivery37
Solving Steiner trees: Recent advances, challenges, and perspectives37
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers34
Modeling the flying sidekick traveling salesman problem with multiple drones29
A two‐tier urban delivery network with robot‐based deliveries28
Trucks and drones cooperation in the last‐mile delivery process26
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements22
“Make no little plans”: Impactful research to solve the next generation of transportation problems22
Controller placement problem in software‐defined networking: A survey21
Parcel delivery cost minimization with time window constraints using trucks and drones18
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach15
Directions for future research on urban mobility and city logistics14
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs12
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks12
Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations12
Fast reliability ranking of matchstick minimal networks11
Generating large scale‐free networks with the Chung–Lu random graph model11
The family traveling salesman problem with incompatibility constraints11
Grocery distribution plans in urban networks with street crossing penalties10
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures10
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems10
Balanced cable routing for offshore wind farms with obstacles9
An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network9
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems8
Uniformly optimally reliable graphs: A survey8
A new MILP formulation for the flying sidekick traveling salesman problem8
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks7
Roots of two‐terminal reliability polynomials7
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings6
An integrated user‐system approach for shelter location and evacuation routing6
In search of dense subgraphs: How good is greedy peeling?6
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods6
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem6
Braess' paradox: A cooperative game‐theoretic point of view5
Minimum cost flow problem with conflicts5
Solving vehicle routing problems with intermediate stops using VRPSolver models5
The time‐consistent dial‐a‐ride problem5
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location5
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem5
A two‐step optimization model for the distribution of perishable products5
An extreme‐point tabu‐search algorithm for fixed‐charge network problems5
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops5
Targeted multiobjective Dijkstra algorithm4
The Gross–Saccoman conjecture is true4
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions4
The multi‐purpose K‐drones general routing problem4
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation4
A fast maximum flow algorithm4
4
Optimizing the ecological connectivity of landscapes4
Finding minimum label spanning trees using cross‐entropy method3
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks3
Improving a constructive heuristic for the general routing problem3
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem3
Decision support for the technician routing and scheduling problem3
The hazardous orienteering problem3
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots3
Minimum k‐cores and the k‐core polytope3
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries3
A multi‐vehicle covering tour problem with speed optimization3
Combinatorial acyclicity models for potential‐based flows3
Formulations and valid inequalities for the capacitated dispersion problem3
Last‐mile delivery with drone and lockers3
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows3
Optimal connected subgraphs: Integer programming formulations and polyhedra3
3
Variable neighborhood search approach with intensified shake for monitor placement2
A novel pseudo‐polynomial approach for shortest path problems2
Integrality in the multinetwork min‐cost equal‐flow problem2
Mobile parcel lockers with individual customer service2
An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints2
On maximum ratio clique relaxations2
A combinatorial branch and bound for the safe set problem2
The consistent production routing problem2
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times2
Continuous approximation formulas for location problems2
Paths and flows for centrality measures in networks2
A combinatorial auction‐based approach for ridesharing in a student transportation system2
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application2
An exact algorithm for the service network design problem with hub capacity constraints2
The inventory routing problem with split deliveries2
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows2
EETTlib—Energy‐efficient train timetabling library2
Yield uncertainty and strategic formation of supply chain networks1
Optimal deployment of indoor wireless local area networks1
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm1
A continuous‐time service network design and vehicle routing problem1
Network augmentation for disaster‐resilience against geographically correlated failure1
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach1
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing1
1
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group1
Impact of knowledge on the cost of treasure hunt in trees1
Preprocessing for segment routing optimization1
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks1
A simple proof of the Gross‐Saccoman multigraph conjecture1
Fast upper and lower bounds for a large‐scale real‐world arc routing problem1
Hybrid genetic algorithm for undirected traveling salesman problems with profits1
Risk‐averse optimization and resilient network flows1
The cumulative school bus routing problem: Polynomial‐size formulations1
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set1
A compact formulation for the base station deployment problem in wireless networks1
Optimal hierarchical clustering on a graph1
Unimodal eccentricity in trees1
On matchings, T‐joins, and arc routing in road networks1
Two‐stage stochastic one‐to‐many driver matching for ridesharing1
Two extended formulations for the virtual network function placement and routing problem1
2019–2020 Glover‐Klingman Prize Winners1
ILP‐based heuristics for a virtual network function placement and routing problem1
Maximum weight perfect matching problem with additional disjunctive conflict constraints1
Min‐sum controllable risk problems with concave risk functions of the same value range1
1
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks1
Efficient presolving methods for the influence maximization problem1
Learning to repeatedly solve routing problems1
Vertex covering with capacitated trees1
Optimizing concurrency under Scheduling by Edge Reversal1
Packing returning secretaries1
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints1
Approximation algorithms for Steiner forest: An experimental study1
Optimizing edge sets in networks to produce ground truth communities based on modularity1
Generalized nash fairness solutions for bi‐objective minimization problems1
A robust optimization framework for two‐echelon vehicle and UAV routing for post‐disaster humanitarian logistics operations1
The k‐path vertex cover: General bounds and chordal graphs1
Solving the routing and spectrum assignment problem, driven by combinatorial properties1
A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs1
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem1
A flow‐based ascending auction to compute buyer‐optimal Walrasian prices1
The single robot line coverage problem: Theory, algorithms, and experiments1
An efficient approach to optimization of semi‐stable routing in multicommodity flow networks1
Issue Information0
Capacity provisioning for evacuation on path networks0
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs0
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning0
Achieving feasibility for clustered traveling salesman problems using PQ‐trees0
Connected graph partitioning with aggregated and non‐aggregated gap objective functions0
0
The probabilistic uncapacitated open vehicle routing location problem0
Traffic rate network tomography with higher‐order cumulants0
New approximations for network reliability0
Preface: Special issue on freight transportation and logistics0
0
More reliable graphs are not always stronger0
Exact solution approaches for the discrete α‐neighbor p‐center problem0
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem0
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines0
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations0
0
A survey on optimization studies of group centrality metrics0
0
Algorithmic solutions for maximizing shareable costs0
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty0
0
Issue Information0
0
The invisible‐hand heuristic for origin‐destination integer multicommodity network flows0
Issue Information0
The complexity of the timetable‐based railway network design problem0
0
On the split reliability of graphs0
Issue Information0
0
Issue Information0
0
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques0
Issue Information0
Issue Information0
A tabu search with geometry‐based sparsification methods for angular traveling salesman problems0
Issue Information0
The b‐bibranching problem: TDI system, packing, and discrete convexity0
Minimizing recovery cost of network optimization problems0
A hybrid genetic algorithm for the Hamiltonian p‐median problem0
Preface: Special issue on the future of city logistics and urban mobility0
Virtual network function reconfiguration in 5G networks: An optimization perspective0
Reducing police response times: Optimization and simulation of everyday police patrol0
Preface: Special issue on network analytics and optimization0
0
Issue Information0
0
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters0
Simplifying obstacles for Steiner network problems in the plane0
Editorial0
Monte Carlo tree search for dynamic shortest‐path interdiction0
A Multi‐Trip Vehicle Routing Problem With Release Dates and Interrelated Periods0
Issue Information0
An improved hybrid genetic search with data mining for the CVRP0
A survivable variant of the ring star problem0
Mean‐standard deviation model for minimum cost flow problem0
Issue Information0
A two‐stage network interdiction‐monitoring game0
Issue Information0
Three network design problems for community energy storage0
Shortest path network interdiction with asymmetric uncertainty0
APPRECIATION TO REFEREES0
0
Editorial: 2021 Glover‐Klingman Prize Winner0
On the complexity of the upgrading version of the maximal covering location problem0
Preface0
Network design with vulnerability constraints and probabilistic edge reliability0
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm0
Heuristic reoptimization of time‐extended multi‐robot task allocation problems0
Issue Information0
A demand‐responsive feeder service with a maximum headway at mandatory stops0
How vulnerable is an undirected planar graph with respect to max flow0
APPRECIATION TO REFEREES0
0
Algorithms and complexity for the almost equal maximum flow problem0
Issue Information0
0
A metaheuristic algorithm for large maximum weight independent set problems0
A cops and robber game and the meeting time of synchronous directed walks0
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals0
The node cop‐win reliability of unicyclic and bicyclic graphs0
0
0
Getting linear time in graphs of bounded neighborhood diversity0
Preface0
Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions0
0
0
Issue Information0
Issue Information0
The complexity landscape of disaster‐aware network extension problems0
Collaborative transportation for attended home deliveries0
Robust capacitated Steiner trees and networks with uniform demands0
Have a Good Travel Time in Routing: Bibliometric Analysis, Literature Review, and Future Directions0
Issue Information0
Issue Information0
0
Valid inequalities and facets for multi‐module survivable network design problem0
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems0
Issue Information0
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis0
Issue Information0
Topology reconstruction using time series data in telecommunication networks0
Issue Information0
A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem0
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts0
Issue Information0
Affine routing for robust network design0
Maximum flow‐based formulation for the optimal location of electric vehicle charging stations0
Issue Information0
A warehouse location‐allocation bilevel problem that considers inventory policies0
A dynamic programming algorithm for order picking in robotic mobile fulfillment systems0
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques0
0
Issue Information0
0
0
Exact reliability optimization for series‐parallel graphs using convex envelopes0
0.048411846160889