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 2020-11-01 to 2024-11-01.)

Article	Citations
Cost‐optimal truck‐and‐robot routing for last‐mile delivery	37
Solving Steiner trees: Recent advances, challenges, and perspectives	37
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers	34
Modeling the flying sidekick traveling salesman problem with multiple drones	29
A two‐tier urban delivery network with robot‐based deliveries	28
Trucks and drones cooperation in the last‐mile delivery process	26
“Make no little plans”: Impactful research to solve the next generation of transportation problems	22
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements	22
Controller placement problem in software‐defined networking: A survey	21
Parcel delivery cost minimization with time window constraints using trucks and drones	18
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach	15
Directions for future research on urban mobility and city logistics	14
Agile optimization for a real‐time facility location problem in Internet of Vehicles networks	12
Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations	12
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs	12
Generating large scale‐free networks with the Chung–Lu random graph model	11
The family traveling salesman problem with incompatibility constraints	11
Fast reliability ranking of matchstick minimal networks	11
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures	10
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems	10
Grocery distribution plans in urban networks with street crossing penalties	10
An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network	9
Balanced cable routing for offshore wind farms with obstacles	9
Uniformly optimally reliable graphs: A survey	8
A new MILP formulation for the flying sidekick traveling salesman problem	8

A survey on exact algorithms for the maximum flow and minimum‐cost flow problems	8
Roots of two‐terminal reliability polynomials	7
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks	7
An integrated user‐system approach for shelter location and evacuation routing	6
In search of dense subgraphs: How good is greedy peeling?	6
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods	6
A mathematical formulation and an LP‐based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem	6
Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings	6
The time‐consistent dial‐a‐ride problem	5
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location	5
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem	5
A two‐step optimization model for the distribution of perishable products	5
An extreme‐point tabu‐search algorithm for fixed‐charge network problems	5
A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops	5
Braess' paradox: A cooperative game‐theoretic point of view	5
Minimum cost flow problem with conflicts	5
Solving vehicle routing problems with intermediate stops using VRPSolver models	5
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions	4
The multi‐purpose K‐drones general routing problem	4
Optimal retrieval in puzzle‐based storage with heuristic search and tabulation	4
A fast maximum flow algorithm	4
	4
Optimizing the ecological connectivity of landscapes	4
Targeted multiobjective Dijkstra algorithm	4
The Gross–Saccoman conjecture is true	4
The hazardous orienteering problem	3
Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots	3
Minimum k‐cores and the k‐core polytope	3
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries	3
A multi‐vehicle covering tour problem with speed optimization	3
Combinatorial acyclicity models for potential‐based flows	3
Formulations and valid inequalities for the capacitated dispersion problem	3
Last‐mile delivery with drone and lockers	3
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows	3
Optimal connected subgraphs: Integer programming formulations and polyhedra	3
	3
Finding minimum label spanning trees using cross‐entropy method	3
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks	3
Improving a constructive heuristic for the general routing problem	3
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem	3
Decision support for the technician routing and scheduling problem	3
A combinatorial branch and bound for the safe set problem	2
The consistent production routing problem	2
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times	2
Continuous approximation formulas for location problems	2
Paths and flows for centrality measures in networks	2
A combinatorial auction‐based approach for ridesharing in a student transportation system	2
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application	2
An exact algorithm for the service network design problem with hub capacity constraints	2
The inventory routing problem with split deliveries	2

Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows	2
EETTlib—Energy‐efficient train timetabling library	2
Variable neighborhood search approach with intensified shake for monitor placement	2
A novel pseudo‐polynomial approach for shortest path problems	2
Integrality in the multinetwork min‐cost equal‐flow problem	2
Mobile parcel lockers with individual customer service	2
An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints	2
On maximum ratio clique relaxations	2