OOIR: Observatory of International Research

Papers

(The TQCC of Networks is 3. 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-04-01 to 2024-04-01.)

Article	Citations
Future directions in drone routing research	49
Arc routing problems: A review of the past, present, and future	45
Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery	45
A branch‐and‐cut approach and alternative formulations for the traveling salesman problem with drone	39
Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers	29
Solving Steiner trees: Recent advances, challenges, and perspectives	28
Cost‐optimal truck‐and‐robot routing for last‐mile delivery	27
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers	26
Modeling the flying sidekick traveling salesman problem with multiple drones	23
Network reliability: Heading out on the highway	23
In search of network resilience: An optimization‐based view	23
An exact bidirectional pulse algorithm for the constrained shortest path	22
Trucks and drones cooperation in the last‐mile delivery process	22
“Make no little plans”: Impactful research to solve the next generation of transportation problems	20
A two‐tier urban delivery network with robot‐based deliveries	20
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements	18
Parcel delivery cost minimization with time window constraints using trucks and drones	18
Controller placement problem in software‐defined networking: A survey	17
Integrating production scheduling and transportation procurement through combinatorial auctions	15
Effects of update frequencies in a dynamic capacitated arc routing problem	12
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach	12
Large‐scale zone‐based evacuation planning—Part I: Models and algorithms	11
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks	11
Fast reliability ranking of matchstick minimal networks	11
Generating large scale‐free networks with the Chung–Lu random graph model	10

Routing electric vehicles with a single recharge per route	10
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs	10
Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations	10
Grocery distribution plans in urban networks with street crossing penalties	10
On the road to better routes: Five decades of published research on the vehicle routing problem	9
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs	9
Directions for future research on urban mobility and city logistics	8
A story of diameter, radius, and (almost) Helly property	8
Large‐scale zone‐based evacuation planning, Part II: Macroscopic and microscopic evaluations	8
On approximate data reduction for the Rural Postman Problem: Theory and experiments	8
The K‐partitioning problem: Formulations and branch‐and‐cut	8
A branch‐and‐cut approach for the least cost influence problem on social networks	8
Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem	7
Weighted target set selection on trees and cycles	7
Telecommunications network design: Technology impacts and future directions	7
The family traveling salesman problem with incompatibility constraints	7
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks	7
An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network	7
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems	7
Uniformly optimally reliable graphs: A survey	6
Roots of two‐terminal reliability polynomials	6
Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge	6
An integrated user‐system approach for shelter location and evacuation routing	5
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings	5
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	5
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures	5
An extreme‐point tabu‐search algorithm for fixed‐charge network problems	5
Plowing with precedence in polynomial time	5
A two‐step optimization model for the distribution of perishable products	5
The mixed capacitated general routing problem with time‐dependent demands	5
Balanced cable routing for offshore wind farms with obstacles	5
A new MILP formulation for the flying sidekick traveling salesman problem	4
Most reliable two‐terminal graphs with node failures	4
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem	4
In search of dense subgraphs: How good is greedy peeling?	4
The time‐consistent dial‐a‐ride problem	4
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions	4
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location	4
A fast maximum flow algorithm	4
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation	4
Braess' paradox: A cooperative game‐theoretic point of view	4
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	4
Minimum cost flow problem with conflicts	4
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem	4
The Gross–Saccoman conjecture is true	4
On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems	3
Finding minimum label spanning trees using cross‐entropy method	3
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows	3
The parking warden tour problem	3
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	3

The stochastic critical node problem over trees	3
Efficient algorithms for finding 2‐medians of a tree	3
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries	3
Solving vehicle routing problems with intermediate stops using VRPSolver models	3
Optimizing the ecological connectivity of landscapes	3
Combinatorial acyclicity models for potential‐based flows	3
Spanning tree modulus for secure broadcast games	3
A branch‐and‐dive heuristic for single vehicle snow removal	3
A multi‐vehicle covering tour problem with speed optimization	3