OOIR: Observatory of International Research

Papers

(The TQCC 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 2021-02-01 to 2025-02-01.)

Article	Citations
Issue Information	38
Optimizing the ecological connectivity of landscapes	37
Issue Information	28
APPRECIATION TO REFEREES	22
	18
Issue Information	15
Issue Information	14
Approximation algorithms for Steiner forest: An experimental study	12
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation	11
Optimal hierarchical clustering on a graph	11
A combinatorial auction‐based approach for ridesharing in a student transportation system	10
	10
A survivable variant of the ring star problem	10
A continuous‐time service network design and vehicle routing problem	9
On maximum ratio clique relaxations	9
Grocery distribution plans in urban networks with street crossing penalties	8
Collaborative transportation for attended home deliveries	8
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set	8
Fast reliability ranking of matchstick minimal networks	7
Editorial	6
EETTlib—Energy‐efficient train timetabling library	6
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks	6
Fast upper and lower bounds for a large‐scale real‐world arc routing problem	6
	5
	5

	5
Issue Information	5
The single robot line coverage problem: Theory, algorithms, and experiments	5
	5
	5
	4
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks	4
	4
Virtual network function reconfiguration in 5G networks: An optimization perspective	4
Balanced cable routing for offshore wind farms with obstacles	4
Maximum flow‐based formulation for the optimal location of electric vehicle charging stations	3
A cops and robber game and the meeting time of synchronous directed walks	3
Decision support for the technician routing and scheduling problem	3
The family traveling salesman problem with incompatibility constraints	3
The b‐bibranching problem: TDI system, packing, and discrete convexity	3
Cost‐optimal truck‐and‐robot routing for last‐mile delivery	3
Paths and flows for centrality measures in networks	3
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach	3
Optimal connected subgraphs: Integer programming formulations and polyhedra	3
	3
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs	3
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations	3
The multi‐purpose K‐drones general routing problem	3
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines	3
Maximum weight perfect matching problem with additional disjunctive conflict constraints	2
APPRECIATION TO REFEREES	2
Solving the routing and spectrum assignment problem, driven by combinatorial properties	2
Issue Information	2
An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints	2
	2
Issue Information	2
Algorithms and complexity for the almost equal maximum flow problem	2
	2
Network design with vulnerability constraints and probabilistic edge reliability	2
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem	2
	2
In search of dense subgraphs: How good is greedy peeling?	2
Issue Information	2
Issue Information	2
A robust optimization framework for two‐echelon vehicle and UAV routing for post‐disaster humanitarian logistics operations	2
	2
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning	1
A Multi‐Trip Vehicle Routing Problem With Release Dates and Interrelated Periods	1
2019–2020 Glover‐Klingman Prize Winners	1
Targeted multiobjective Dijkstra algorithm	1
Issue Information	1
Two‐stage stochastic one‐to‐many driver matching for ridesharing	1
Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions	1
Preface: Special issue on network analytics and optimization	1
	1

On matchings, T‐joins, and arc routing in road networks	1
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	1
Issue Information	1
Issue Information	1
A multi‐vehicle covering tour problem with speed optimization	1
	1
New approximations for network reliability	1
	1
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows	1
Editorial: 2021 Glover‐Klingman Prize Winner	1
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts	1
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem	1
Have a Good Travel Time in Routing: Bibliometric Analysis, Literature Review, and Future Directions	1
A warehouse location‐allocation bilevel problem that considers inventory policies	1
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques	1
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem	1
Optimizing edge sets in networks to produce ground truth communities based on modularity	1
	1
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers	1
A dynamic programming algorithm for order picking in robotic mobile fulfillment systems	1
The workforce scheduling and routing problem with park‐and‐loop	1
Generalized nash fairness solutions for bi‐objective minimization problems	1
Exact solution approaches for the discrete α‐neighbor p‐center problem	1
Issue Information	1
Impact of knowledge on the cost of treasure hunt in trees	1
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters	1
Affine routing for robust network design	1
	1
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations	1
The node cop‐win reliability of unicyclic and bicyclic graphs	1
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques	1
	1
Issue Information	1
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing	1