9 citations · 12 across the 8 of their papers we have counts for
9 papers
A General Variable Neighborhood Search for Logistic Network Flow Design with Nonlinear Edge Costs and Transshipment Capacities
Varvara Kovaleva, Alexander Ponomarenko
We study the problem of routing multiple commodities through a logistic transport network so as to minimise the joint cost of vehicle movements and of transshipment (reload) operat…
A Benchmark Generator of Realistic Logistic Transport Networks with Nonlinear Edge Costs and Transshipment Capacities
Varvara Kovaleva, Alexander Ponomarenko
Routing many commodities through a logistic network at minimum joint cost of vehicle movements and transshipment at intermediate storages becomes substantially harder -- and substa…
Tuning Dispatch Thresholds for Fixed Last-Mile Routes: A Simulation-Based Pareto Analysis of a Production Policy
Alexander Ponomarenko, Ilya Antonov
Many parcel networks dispatch vehicles on \emph{fixed routes} using a simple load-accumulation rule: a truck leaves the depot for a fixed route as soon as the volume (or item count…
Greedy Routing in a Sequentially Grown One-Dimensional Random Graph
Alexander Ponomarenko
We analyze greedy routing in a random graph G_n constructed on the vertex set V = {1, 2, ..., n} embedded in Z. Vertices are inserted according to a uniform random permutation pi,…
Three Algorithms for Merging Hierarchical Navigable Small World Graphs
Alexander Ponomarenko
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database com…
Dota Underlords game is NP-complete
Alexander A. Ponomarenko, Dmitry V. Sirotkin
In this paper, we demonstrate how the problem of the optimal team choice in the popular computer game Dota Underlords can be reduced to the problem of linear integer programming. W…
Overlapping community detection in networks based on link partitioning and partitioning around medoids
Alexander Ponomarenko, Leonidas Pitsoulis, Marat Shamshetdinov
In this paper, we present a new method for detecting overlapping communities in networks with a predefined number of clusters called LPAM (Link Partitioning Around Medoids). The ov…
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search
Alexander Ponomarenko, Irina Utkina, Mikhail Batsyn
One of the approaches for the nearest neighbor search problem is to build a network which nodes correspond to the given set of indexed objects. In this case the search of the close…
Growing homophilic networks are natural navigable small worlds
Yury A. Malkov, Alexander Ponomarenko
Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. Howeve…