OOIR: Observatory of International Research

Papers

(The TQCC of Networks is 2. 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 2021-05-01 to 2025-05-01.)

Article	Citations
Issue Information	44
A survivable variant of the ring star problem	26
	20
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	14
Balanced cable routing for offshore wind farms with obstacles	14
A combinatorial auction‐based approach for ridesharing in a student transportation system	13
A continuous‐time service network design and vehicle routing problem	11
A cops and robber game and the meeting time of synchronous directed walks	11
	11
Targeted multiobjective Dijkstra algorithm	10
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers	10
The Minimum Clique Routing Problem on Cycles	10
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts	10
The node cop‐win reliability of unicyclic and bicyclic graphs	9
A warehouse location‐allocation bilevel problem that considers inventory policies	9
Affine routing for robust network design	9
Uniformly optimally reliable graphs: A survey	8
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm	7
The cumulative school bus routing problem: Polynomial‐size formulations	7
The complexity of the timetable‐based railway network design problem	7
Issue Information	6
Issue Information	6
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	6
Issue Information	5
The complexity landscape of disaster‐aware network extension problems	5

	5
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals	5
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures	5
A demand‐responsive feeder service with a maximum headway at mandatory stops	5
A genetic approach for the 2‐edge‐connected minimum branch vertices problem	4
An integrated user‐system approach for shelter location and evacuation routing	4
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems	4
Minimum k‐cores and the k‐core polytope	4
	4
	4
A new MILP formulation for the flying sidekick traveling salesman problem	4
A metaheuristic algorithm for large maximum weight independent set problems	4
Existence of optimally‐greatest digraphs for strongly connected node reliability	4
Grocery distribution plans in urban networks with street crossing penalties	3
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	3
Algorithms and complexity for the almost equal maximum flow problem	3
Solving the routing and spectrum assignment problem, driven by combinatorial properties	3
Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport	3
Issue Information	3
	3
New approximations for network reliability	3
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	3
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks	3
Issue Information	3
	3
Generalized nash fairness solutions for bi‐objective minimization problems	3
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	2
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	2
Optimal error‐detection system for identifying codes	2
	2
Optimal deployment of indoor wireless local area networks	2
On the split reliability of graphs	2
The inventory routing problem with split deliveries	2
Robust capacitated Steiner trees and networks with uniform demands	2
Continuous approximation formulas for location problems	2
A hybrid genetic algorithm for the Hamiltonian p‐median problem	2
Directions for future research on urban mobility and city logistics	2
Semi‐labeled unrooted binary tree optimization subject to nonnegativity	2
Balancing graph Voronoi diagrams with one more vertex	2
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning	2
Traffic rate network tomography with higher‐order cumulants	2
Monte Carlo tree search for dynamic shortest‐path interdiction	2
Network augmentation for disaster‐resilience against geographically correlated failure	2
Algorithmic solutions for maximizing shareable costs	2
An exact algorithm for the service network design problem with hub capacity constraints	2
A tabu search with geometry‐based sparsification methods for angular traveling salesman problems	2
A simple proof of the Gross‐Saccoman multigraph conjecture	2
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm	2
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	2
Maximum weight perfect matching problem with additional disjunctive conflict constraints	2