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-07-01 to 2024-07-01.)

Article	Citations
Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery	53
Future directions in drone routing research	51
Cost‐optimal truck‐and‐robot routing for last‐mile delivery	34
Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers	34
Solving Steiner trees: Recent advances, challenges, and perspectives	33
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers	29
In search of network resilience: An optimization‐based view	28
Trucks and drones cooperation in the last‐mile delivery process	26
Modeling the flying sidekick traveling salesman problem with multiple drones	25
Network reliability: Heading out on the highway	24
“Make no little plans”: Impactful research to solve the next generation of transportation problems	22
A two‐tier urban delivery network with robot‐based deliveries	22
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements	21
Controller placement problem in software‐defined networking: A survey	19
Parcel delivery cost minimization with time window constraints using trucks and drones	18
Integrating production scheduling and transportation procurement through combinatorial auctions	15
Large‐scale zone‐based evacuation planning—Part I: Models and algorithms	13
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach	13
Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations	12
Effects of update frequencies in a dynamic capacitated arc routing problem	12
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks	12
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs	12
Generating large scale‐free networks with the Chung–Lu random graph model	11
Fast reliability ranking of matchstick minimal networks	11
Directions for future research on urban mobility and city logistics	10

Grocery distribution plans in urban networks with street crossing penalties	10
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs	9
The family traveling salesman problem with incompatibility constraints	9
Weighted target set selection on trees and cycles	9
An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network	9
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems	9
A story of diameter, radius, and (almost) Helly property	9
On approximate data reduction for the Rural Postman Problem: Theory and experiments	8
Large‐scale zone‐based evacuation planning, Part II: Macroscopic and microscopic evaluations	8
Telecommunications network design: Technology impacts and future directions	8
Uniformly optimally reliable graphs: A survey	7
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks	7
The mixed capacitated general routing problem with time‐dependent demands	7
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	6
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings	6
Balanced cable routing for offshore wind farms with obstacles	6
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures	6
Roots of two‐terminal reliability polynomials	6
A new MILP formulation for the flying sidekick traveling salesman problem	6
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem	6
A two‐step optimization model for the distribution of perishable products	5
Minimum cost flow problem with conflicts	5
Plowing with precedence in polynomial time	5
The time‐consistent dial‐a‐ride problem	5
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location	5
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem	5
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	5
An integrated user‐system approach for shelter location and evacuation routing	5
An extreme‐point tabu‐search algorithm for fixed‐charge network problems	5
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	5
Most reliable two‐terminal graphs with node failures	4
Targeted multiobjective Dijkstra algorithm	4
The Gross–Saccoman conjecture is true	4
Braess' paradox: A cooperative game‐theoretic point of view	4
A fast maximum flow algorithm	4
	4
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions	4
In search of dense subgraphs: How good is greedy peeling?	4
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation	4
Finding minimum label spanning trees using cross‐entropy method	3
Efficient algorithms for finding 2‐medians of a tree	3
Improving a constructive heuristic for the general routing problem	3
A multi‐vehicle covering tour problem with speed optimization	3
On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems	3
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks	3
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries	3
The parking warden tour problem	3
The multi‐purpose K‐drones general routing problem	3
Combinatorial acyclicity models for potential‐based flows	3
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows	3

A branch‐and‐dive heuristic for single vehicle snow removal	3
Solving vehicle routing problems with intermediate stops using VRPSolver models	3
Optimizing the ecological connectivity of landscapes	3