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-10-01 to 2025-10-01.)

Article	Citations
Issue Information	31
	20
A survivable variant of the ring star problem	17
A cops and robber game and the meeting time of synchronous directed walks	17
On Combining Conventional Point‐To‐Point and Automated Waste Collection Systems	15
Balanced cable routing for offshore wind farms with obstacles	12
A continuous‐time service network design and vehicle routing problem	12
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	12
The Minimum Clique Routing Problem on Cycles	11
	11
Targeted multiobjective Dijkstra algorithm	11
A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem	10
The complexity of the timetable‐based railway network design problem	8
A warehouse location‐allocation bilevel problem that considers inventory policies	8
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm	7
Issue Information	7
Uniformly optimally reliable graphs: A survey	7
Issue Information	7
A demand‐responsive feeder service with a maximum headway at mandatory stops	6
Issue Information	6
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	6
The cumulative school bus routing problem: Polynomial‐size formulations	6
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals	6
Precedence‐Constrained Shortest Path	5
Existence of optimally‐greatest digraphs for strongly connected node reliability	5

The complexity landscape of disaster‐aware network extension problems	5
	5
	5
Minimum k‐cores and the k‐core polytope	5
A metaheuristic algorithm for large maximum weight independent set problems	5
A genetic approach for the 2‐edge‐connected minimum branch vertices problem	5
Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport	4
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	4
	4
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks	4
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method	4
Issue Information	4
Issue Information	4
Issue Information	4
Issue Information	4
A new MILP formulation for the flying sidekick traveling salesman problem	4
	3
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	3
	3
New approximations for network reliability	3
A hybrid genetic algorithm for the Hamiltonian p‐median problem	3
Traffic rate network tomography with higher‐order cumulants	3
Monte Carlo tree search for dynamic shortest‐path interdiction	3
	3
Maximum weight perfect matching problem with additional disjunctive conflict constraints	3
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	3
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	3
Algorithmic solutions for maximizing shareable costs	3
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	3
Generalized nash fairness solutions for bi‐objective minimization problems	3
Algorithms and complexity for the almost equal maximum flow problem	3
Solving the routing and spectrum assignment problem, driven by combinatorial properties	3
Continuous approximation formulas for location problems	3
Robust capacitated Steiner trees and networks with uniform demands	3
Network augmentation for disaster‐resilience against geographically correlated failure	3
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines	2
Complexity Results for a Cops and Robber Game on Directed Graphs	2
Variable neighborhood search approach with intensified shake for monitor placement	2
Directions for future research on urban mobility and city logistics	2
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm	2
Optimal deployment of indoor wireless local area networks	2
Balancing graph Voronoi diagrams with one more vertex	2
A Fix‐And‐Optimize Matheuristic to Solve the Location‐Allocation of Vaccination Facilities: Case of Jalisco, Mexico	2
Yield uncertainty and strategic formation of supply chain networks	2
A new linear path pair availability constraint for network design	2
	2
Editorial	2
Issue Information	2
Semi‐labeled unrooted binary tree optimization subject to nonnegativity	2
Optimal error‐detection system for identifying codes	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
On the split reliability of graphs	2
Branch‐and‐Bound Algorithms for the K$$ K $$‐Cluster Problem Based on SDP Bounds Evaluated by Lagrangian Relaxation	2
On the Complexity of the Bilevel Shortest Path Problem	2
	2
Preprocessing for segment routing optimization	2
Issue Information	2
A simple proof of the Gross‐Saccoman multigraph conjecture	2
	2
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning	2
The inventory routing problem with split deliveries	2
An Exact Algorithm for the Hazardous Orienteering Problem	2
Paths and flows for centrality measures in networks	2