?
A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse
Procedia Computer Science. 2014. Vol. 31. P. 773–777.
There exist a number of mathematical problems in the literature concerning warehouse storage optimization. However, to the best of our knowledge the problem of finding optimal slot sizes in pallet rack system minimizing the occupied storage space is not studied. More precisely, the problem is to optimally choose k of m pallet racks with pallets in a warehouse, find optimal slot sizes in pallet racks for these pallets, and reassign the pallets to the new slots in order to reduce the occupied space maximally. In this paper we suggest a dynamic programming heuristic which finds optimal slot sizes for the given number k of pallet racks in a warehouse. Our computational experiments are based on real-life data and demonstrate the efficiency of the suggested algorithm.
Shabanov N., Kuricheva O., Kurbatova J. et al., / Series Working Papers SSRN "Department of Economics Ca’ Foscari University of Venice". 2026.
The carbon balance of an ecosystem is the difference between Gross Primary Productivity (GPP) and Ecosystem Respiration (Reco) as expressed by Net Ecosystem Exchange (NEE). While remote sensing retrievals of GPP have reached maturity, Reco estimation remains underexplored and ultimately cast bias on NEE. Here we present an end-to-end multi-scale analysis of the mechanism of ...
Added: August 21, 2026
Belomestny D., Gasnikov A., Gladin E. et al., Russian Mathematical Surveys 2026 Vol. 81 No. 4(490) P. 3–90
Reinforcement learning (RL) is increasingly grounded in tools from probability, optimization, and operator theory. This survey organizes the mathematical structures that underpin the design and analysis of modern algorithms in RL. We begin from Markov decision processes (MDPs) and the Bellman operators, emphasizing contraction mappings, monotonicity, and fixed-point theory that yield convergence guarantees and rates ...
Added: August 3, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Petrovanov I., Sergeev A., / Series Computer Science "arxiv.org". 2025. No. 2512.18332.
Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: original packets are encoded into coded packets, and the message is reconstructed after the first successful deliveries, effectively shifting latency from the maximum packet delay to the -th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including ...
Added: December 24, 2025
Hessian-based lightweight neural network for brain vessel segmentation on a minimal training dataset
Меньшиков И. А., Бернадотт А. К., Elvimov N. S., / Series arXie "Statistical mechanics". 2025.
Accurate segmentation of blood vessels in brain magnetic resonance angiography (MRA) is essential for successful surgical procedures, such as aneurysm repair or bypass surgery. Currently, annotation is primarily performed through manual segmentation or classical methods, such as the Frangi filter, which often lack sufficient accuracy. Neural networks have emerged as powerful tools for medical image ...
Added: December 1, 2025
Burashnikov E., Operations Research Forum 2024
Added: September 21, 2024
D. V. Gribanov, Shumilov I. A., D. S. Malyshev, Optimization Letters 2024 Vol. 18 P. 73–103
In this work we consider the problem of computing the (min,+)-convolution of two sequences a and b of lengths n and m, respectively, where n≥m. We assume that a is arbitrary, but b_i=f(i), where f(x):[0,m)→R is a function with one of the following properties: f is linear, f is monotone, f is convex, f is concave, f is piece-wise linear, f is a polynomial function of a fixed degree. To the best of our knowledge, the concave, piece-wise linear and polynomial ...
Added: May 28, 2023
Maron A., Maron M., Вестник Московского авиационного института 2022 Т. 29 № 2 С. 158–165
The relevance of this work is due to the fact, that reducing the time of searching and the time for eliminating defects in civil aviation passenger aircraft can significantly reduce departure delays and the associated losses of airlines. The analysis of statistical data shows that the searching and eliminating defects are the dominant causes of ...
Added: September 30, 2022
Afanasiev V., М.: Красанд/URSS, 2020.
This book has been prepared on the basis of lectures on control theory given by the author for a number of years to students of the Department of Applied Mathematics of the National Research University Higher School of Economics and the Faculty of Physics Moscow State University named after M. V. Lomonosov. The content of the ...
Added: August 27, 2022
Andreev N. A., Smirnov S. N., Computational Mathematics and Modeling 2021 Vol. 32 P. 22–44
We consider a guaranteed deterministic approach to discrete-time super-replication for guaranteed coverage of contingent claims on options for all possible asset-price scenarios. Price increases during a period are assumed to be contained in a priori specified compacta dependent on price history. A game problem is stated and reduced to the solution of the corresponding Bellman–Isaacs ...
Added: September 30, 2021
Pospelov I. G., Zhukova A., , in: 2020 European Control Conference (ECC).: Institute of Electrical and Electronics Engineers Inc., 2020. P. 1129–1134.
This paper presents the approach to solving optimal control problems that appear in economic models using the Lagrange's multipliers method. This method is not as widely used as it might be, taking into accounts its benefits and convenience. The power of this method for intertemporal general equilibrium allows building complex structural models of the whole ...
Added: December 8, 2020
Andreev N. A., В кн.: "Тихоновские чтения": научная конференция: тезисы докладов: посвящается памяти академика Андрея Николаевича Тихонова: 29 октября-1 ноября 2019 г.: М.: ООО «Макс Пресс», 2019. С. 14–14.
Доклад посвящен приложению гарантированного подхода, предложенного Смирновым С.Н. [1],[2], к задаче управления портфелем финансовых инструментов на низколиквидном рынке с учетом модельной ошибки. Рассматривается игровая постановка в дискретном времени на конечном горизонте, в рамках которой инвестор максимизирует ожидаемое вознаграждение от портфеля (робастный эквивалент Сэвиджа) в конце стратегии. Оптимальная стратегия находится в неявном виде как решение соответствующего ...
Added: October 30, 2019
Andreev N. A., Mathematics 2019 Vol. 7 No. 12 P. 1147
We present a robust dynamic programming approach to the general portfolio selection problem in the presence of transaction costs and trading limits. We formulate the problem as a dynamic infinite game against nature and obtain the corresponding Bellman-Isaacs equation. Under~several additional assumptions, we get an alternative form of the equation, which is more feasible for ...
Added: October 30, 2019
Andreev N. A., Smirnov S. N., В кн.: "Тихоновские чтения": научная конференция: тезисы докладов: посвящается памяти академика Андрея Николаевича Тихонова: 29 октября-2 ноября 2018 г.: М.: МАКС Пресс, 2018. С. 11–11.
Управление портфелем ценных бумаг, для целей инвестирования или хеджирования, относится к классическим задачам финансовой математики, которые допускают различные постановки, обычно использующие стохастическое динамическое программирование, где управляемым объектом является структура портфеля, а рынок описывается некоторым стохастическим процессом.
Доклад посвящен альтернативе общепринятого стохастического подхода, - за основу берется неопределенность поведения рынка в будущем, а динамика рынка описывается одним ...
Added: October 30, 2018
Pham Cong T., Копылов А. В., Computer Optics 2018 P. 1–8
We consider here image denoising procedures, based on computationally effective tree-serial parametric dynamic programming procedures, different representations of an image lattice by the set of acyclic graphs and non-convex regularization of a new type which allows to flexibly set a priori preferences. Experimental results in image denoising, as well as comparison with related methods, are ...
Added: July 21, 2018
Zinder Y., Lazarev A. A., Musatova E. G. et al., Automation and Remote Control 2018 Vol. Vol. 79 No. 3 P. 506–523
The paper is concerned with scheduling the two-way traffic between two stations connected by a single-track railway with a siding. It is shown that if, for each station, the order in which trains leave this station is known or can be found, then for various objective functions an optimal schedule can be constructed in polynomial ...
Added: May 30, 2018
А.А.Лазарев, Зиндер Я., Мусатова Е. Г. et al., Автоматика и телемеханика 2018 № 3 С. 144–166
The paper is concerned with scheduling the two-way traffic between two stations connected by a single-track railway with a siding. It is shown that if, for each station, the order in which trains leave this station is known or can be found, then for various objective functions an optimal schedule can be constructed in polynomial ...
Added: May 30, 2018