OOIR: Observatory of International Research

Papers

(The median citation count of Networks is 1. 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-01-01 to 2026-01-01.)

Article	Citations
Issue Information	31
A cops and robber game and the meeting time of synchronous directed walks	23
	20
On Combining Conventional Point‐To‐Point and Automated Waste Collection Systems	18
A survivable variant of the ring star problem	18
	16
A continuous‐time service network design and vehicle routing problem	16
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	13
Balanced cable routing for offshore wind farms with obstacles	13
	12
The Minimum Clique Routing Problem on Cycles	11
Perfect Matching Under Precedence Constraints	10
A warehouse location‐allocation bilevel problem that considers inventory policies	9
Targeted multiobjective Dijkstra algorithm	9
Mixed‐Integer Linear Programming Approaches for Nested p$$ p $$‐Center Problems With Absolute and Relative Regret Objectives	9
A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem	9
The complexity of the timetable‐based railway network design problem	8
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm	8
Issue Information	7
Issue Information	7
A demand‐responsive feeder service with a maximum headway at mandatory stops	7
The cumulative school bus routing problem: Polynomial‐size formulations	6
	6
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	6
	6

A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals	6
Issue Information	6
A genetic approach for the 2‐edge‐connected minimum branch vertices problem	5
Precedence‐Constrained Shortest Path	5
Issue Information	5
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	5
A metaheuristic algorithm for large maximum weight independent set problems	5
Issue Information	5
A new MILP formulation for the flying sidekick traveling salesman problem	5
Incorporating Fairness Into the Gateway‐Based Risk Mitigation Policy for Hazmat Transport	5
	5
Existence of optimally‐greatest digraphs for strongly connected node reliability	5
The complexity landscape of disaster‐aware network extension problems	5
Issue Information	5
Issue Information	5
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method	4
	4
	4
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	4
A tabu search with geometry‐based sparsification methods for angular traveling salesman problems	3
Algorithms and complexity for the almost equal maximum flow problem	3
	3
New approximations for network reliability	3
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	3
Robust capacitated Steiner trees and networks with uniform demands	3
Network augmentation for disaster‐resilience against geographically correlated failure	3
Optimal deployment of indoor wireless local area networks	3
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	3
Maximum weight perfect matching problem with additional disjunctive conflict constraints	3
Generalized nash fairness solutions for bi‐objective minimization problems	3
The inventory routing problem with split deliveries	3
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	3
On the split reliability of graphs	3
Traffic rate network tomography with higher‐order cumulants	3
Monte Carlo tree search for dynamic shortest‐path interdiction	3
Solving the routing and spectrum assignment problem, driven by combinatorial properties	3
Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem	3
Continuous approximation formulas for location problems	3
A hybrid genetic algorithm for the Hamiltonian p‐median problem	3
Algorithmic solutions for maximizing shareable costs	3
Variable neighborhood search approach with intensified shake for monitor placement	2
The multi‐purpose K‐drones general routing problem	2
Paths and flows for centrality measures in networks	2
	2
Branch‐and‐Bound Algorithms for the K$$ K $$‐Cluster Problem Based on SDP Bounds Evaluated by Lagrangian Relaxation	2
A simple proof of the Gross‐Saccoman multigraph conjecture	2
A new linear path pair availability constraint for network design	2
An exact algorithm for the service network design problem with hub capacity constraints	2
Directions for future research on urban mobility and city logistics	2
	2

Preprocessing for segment routing optimization	2
Issue Information	2
An A‐Priori‐Splitting‐Based Heuristic for the Split Delivery Vehicle Routing Problem With Time Windows	2
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines	2
	2
Complexity Results for a Cops and Robber Game on Directed Graphs	2
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning	2
Underground Freight Transportation for Package Delivery in Urban Environments	2
Optimal error‐detection system for identifying codes	2
Issue Information	2
Issue Information	2
Capacitated Vehicle Routing Problem with a Zone Tariff	2
On the Complexity of the Bilevel Shortest Path Problem	2
Issue Information	2
Editorial	2
Semi‐labeled unrooted binary tree optimization subject to nonnegativity	2
A Fix‐And‐Optimize Matheuristic to Solve the Location‐Allocation of Vaccination Facilities: Case of Jalisco, Mexico	2
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm	2
An Exact Algorithm for the Hazardous Orienteering Problem	2
Balancing graph Voronoi diagrams with one more vertex	2
Yield uncertainty and strategic formation of supply chain networks	2
Finding conserved low‐diameter subgraphs in social and biological networks	1
Issue Information	1
Editorial: 2021 Glover‐Klingman Prize Winner	1
Virtual network function reconfiguration in 5G networks: An optimization perspective	1
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks	1
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend	1
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group	1
Exact reliability optimization for series‐parallel graphs using convex envelopes	1
	1
Hybrid genetic algorithm for undirected traveling salesman problems with profits	1
Finding the Maximum Subgraph of Prescribed Strength	1
A Multi‐Trip Vehicle Routing Problem With Release Dates and Interrelated Periods	1
Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions	1
	1
Issue Information	1
	1
Issue Information	1
	1
Speeding Up the Solution of the Site and Power Assignment Problem in Wireless Networks	1
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs	1
Min–max optimization of node‐targeted attacks in service networks	1
An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations	1
Asymptotic bounds for clustering problems in random graphs	1
On the complexity of the bilevel minimum spanning tree problem	1
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots	1
Achieving feasibility for clustered traveling salesman problems using PQ‐trees	1
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters	1
	1
Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems	1
Avoiding Deadlocks via Weak Deadlock Sets	1
Decision support for the technician routing and scheduling problem	1
Issue Information	1
A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem	1
Hisom: Hierarchical Self‐Organizing Map for Solving Multiple Traveling Salesman Problems	1
Issue Information	1
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements	1
Two extended formulations for the virtual network function placement and routing problem	1
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements	1
The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value	1
Heuristic reoptimization of time‐extended multi‐robot task allocation problems	1
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques	1