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 2022-05-01 to 2026-05-01.)

Article	Citations
	28
On Combining Conventional Point‐To‐Point and Automated Waste Collection Systems	21
	20
A survivable variant of the ring star problem	19
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	17
A continuous‐time service network design and vehicle routing problem	15
Balanced cable routing for offshore wind farms with obstacles	14
	12
A cops and robber game and the meeting time of synchronous directed walks	12
The Minimum Clique Routing Problem on Cycles	12
A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem	11
Targeted multiobjective Dijkstra algorithm	9
A warehouse location‐allocation bilevel problem that considers inventory policies	9
Perfect Matching Under Precedence Constraints	9
The complexity of the timetable‐based railway network design problem	8
Issue Information	8
Mixed‐Integer Linear Programming Approaches for Nested p$$ p $$‐Center Problems With Absolute and Relative Regret Objectives	8
Ordered Median Traveling Salesman Problem	8
Issue Information	8
Extending the Inventory Routing Problem to Support Integrated Decision‐Making in an Urban Distribution Network	7
The cumulative school bus routing problem: Polynomial‐size formulations	7
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	7
Issue Information	7
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm	7
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals	6

The complexity landscape of disaster‐aware network extension problems	6
Issue Information	6
Issue Information	6
	6
A new MILP formulation for the flying sidekick traveling salesman problem	6
Precedence‐Constrained Shortest Path	6
A demand‐responsive feeder service with a maximum headway at mandatory stops	6
	6
A genetic approach for the 2‐edge‐connected minimum branch vertices problem	6
Existence of optimally‐greatest digraphs for strongly connected node reliability	6
Exact Solutions for the Moving Firefighter Problem on Trees	5
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method	5
A metaheuristic algorithm for large maximum weight independent set problems	5
Issue Information	5
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	5
	5
Issue Information	5
	5
Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport	5
Generalized nash fairness solutions for bi‐objective minimization problems	4
	4
Maximum weight perfect matching problem with additional disjunctive conflict constraints	4
Robust capacitated Steiner trees and networks with uniform demands	4
Algorithms and complexity for the almost equal maximum flow problem	4
Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem	4
Monte Carlo tree search for dynamic shortest‐path interdiction	4
Algorithmic solutions for maximizing shareable costs	4
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	4
Solving the routing and spectrum assignment problem, driven by combinatorial properties	4
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	4
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	4
New approximations for network reliability	4
On the split reliability of graphs	3
Issue Information	3
Consistent Collaborative Vehicle Utilization	3
Yield uncertainty and strategic formation of supply chain networks	3
A new linear path pair availability constraint for network design	3
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning	3
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	3
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm	3
The inventory routing problem with split deliveries	3
	3
Balancing graph Voronoi diagrams with one more vertex	3
A tabu search with geometry‐based sparsification methods for angular traveling salesman problems	3
A hybrid genetic algorithm for the Hamiltonian p‐median problem	3
Network augmentation for disaster‐resilience against geographically correlated failure	3
An exact algorithm for the service network design problem with hub capacity constraints	3
Optimal deployment of indoor wireless local area networks	3
A simple proof of the Gross‐Saccoman multigraph conjecture	3
Optimal error‐detection system for identifying codes	3

Traffic rate network tomography with higher‐order cumulants