Journal of Applied and Industrial Mathematics最新文献

筛选
英文 中文
Updated Estimates for Algorithms for Packing2-Bar Charts in a Strip 条形图包装算法的更新估计
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040112
S. A. Nazarenko
{"title":"Updated Estimates for Algorithms for Packing\u00002-Bar Charts in a Strip","authors":"S. A. Nazarenko","doi":"10.1134/S1990478924040112","DOIUrl":"10.1134/S1990478924040112","url":null,"abstract":"<p> We consider a two-bar charts packing problem in which it is necessary to pack bar charts\u0000consisting of two bars in a unit-height strip of minimum length. Each bar has a height of at most\u00001 and unit length. The problem under consideration is NP-hard and generalizes the bin packing\u0000problem and two-dimensional vector packing problem. This paper proves updated accuracy\u0000estimates and time complexity for several previously developed polynomial approximation\u0000algorithms for the two-bar charts packing problem and particular cases of the problem. We show\u0000the attainability of the estimates. Furthermore, we consider a problem of packing an unlimited\u0000number of bar charts belonging to\u0000<span>( k )</span> different types and propose a polynomial algorithm to solve the problem in\u0000case\u0000<span>( k = text {const} )</span>.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"759 - 774"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Uniform Attractors for the Kelvin–Voigt Model Taking intoAccount Memory along Fluid Motion Trajectories 考虑沿流体运动轨迹记忆的Kelvin-Voigt模型的均匀吸引子
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040227
M. V. Turbin, A. S. Ustiuzhaninova
{"title":"Uniform Attractors for the Kelvin–Voigt Model Taking into\u0000Account Memory along Fluid Motion Trajectories","authors":"M. V. Turbin,&nbsp;A. S. Ustiuzhaninova","doi":"10.1134/S1990478924040227","DOIUrl":"10.1134/S1990478924040227","url":null,"abstract":"<p> The paper is devoted to the study of the qualitative behavior of solutions for the\u0000Kelvin–Voigt model taking into account memory along fluid motion trajectories. Namely, based\u0000on the theory of attractors of noninvariant trajectory spaces, for the model under consideration in\u0000the nonautonomous case the existence of a uniform trajectory and a uniform global attractor is\u0000proved under certain conditions on the coefficients.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"905 - 917"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computation of a Distance Field by Means of CombinedGeometry Representation in Fluid Dynamics Simulations with EmbeddedBoundaries 嵌入边界流体动力学模拟中用组合几何表示计算距离场
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040070
M. Y. Hrebtov, R. I. Mullyadzhanov
{"title":"Computation of a Distance Field by Means of Combined\u0000Geometry Representation in Fluid Dynamics Simulations with Embedded\u0000Boundaries","authors":"M. Y. Hrebtov,&nbsp;R. I. Mullyadzhanov","doi":"10.1134/S1990478924040070","DOIUrl":"10.1134/S1990478924040070","url":null,"abstract":"<p> We present a method for calculating the signed distance field to three-dimensional\u0000geometric models by representing them as a result of Boolean operations on elementary objects for\u0000each of which the signed distance is known. Two versions of the algorithm are proposed. The first\u0000is a simplified version for quick calculation of the rough distance approximation (with an exact\u0000zero isosurface and correct separation of domains inside and outside the model). The second\u0000version includes calculation of the distance to the intersection contours between elements, allowing\u0000the distance to be reconstructed with a greater accuracy without considerable additional\u0000computational costs. Both methods are much faster than the computation of distance based on\u0000the triangulation of the surfaces. The proposed approach also allows for interactively changing\u0000relative positions and orientation of the geometry parts; this makes it possible to perform\u0000calculations with moving boundaries. The approach has been tested in fluid dynamics simulation\u0000with an interphase boundary and adaptive multilevel grid refinement in <span>Basilisk</span> open source code for simulation of\u0000multiphase flows.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"697 - 708"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mathematical Foundations of the IsobolographicMethod 等抛物线法的数学基础
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040148
V. G. Panov
{"title":"Mathematical Foundations of the Isobolographic\u0000Method","authors":"V. G. Panov","doi":"10.1134/S1990478924040148","DOIUrl":"10.1134/S1990478924040148","url":null,"abstract":"<p> More precise definitions of concepts and constructs used in biomedical sciences are\u0000proposed to analyze the joint action of factors using isobolograms. Formal definitions of concepts\u0000of zero interaction, scale-equivalent dose–response functions, and zero-interaction manifold are\u0000given. A general construction is proposed that formalizes the conditions of applicability and the\u0000basic methods for analyzing the combined action using isoboles. Equations of zero-interaction\u0000manifolds are derived both in the case of scale-equivalent and arbitrary dose–response functions.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"800 - 811"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Greedy Algorithm for the Resource-Constrained ProjectScheduling Problem 资源约束项目调度问题的贪心算法
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040057
E. N. Goncharov
{"title":"A Greedy Algorithm for the Resource-Constrained Project\u0000Scheduling Problem","authors":"E. N. Goncharov","doi":"10.1134/S1990478924040057","DOIUrl":"10.1134/S1990478924040057","url":null,"abstract":"<p> The resource-constrained project scheduling problem (briefly RCPSP) is a general\u0000scheduling problem that includes precedence and resource constraints. Activities preemptions are\u0000not allowed. Resources are renewable and there is a unique way to perform the activities. The\u0000problem with renewable resources is NP-hard in the strong sense. We propose a new deterministic\u0000greedy algorithm. It is based on heuristics that use information obtained from a relaxing problem.\u0000The algorithm is tested with standard data sets given by Kolisch library PSPLIB for j60, j90, and\u0000j120 and found to be performing well.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"679 - 685"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Numerical Reconstruction of a Two-Dimensional Vector Fieldfrom Its Momentum Ray Transforms 二维矢量场动量射线变换的数值重建
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040197
I. E. Svetov, E. Yu. Derevtsov, S. V. Maltseva, A. P. Polyakova
{"title":"Numerical Reconstruction of a Two-Dimensional Vector Field\u0000from Its Momentum Ray Transforms","authors":"I. E. Svetov,&nbsp;E. Yu. Derevtsov,&nbsp;S. V. Maltseva,&nbsp;A. P. Polyakova","doi":"10.1134/S1990478924040197","DOIUrl":"10.1134/S1990478924040197","url":null,"abstract":"<p> The algorithms for reconstructing a vector field from its known longitudinal or transverse\u0000ray transforms of its moment are proposed and justified. The properties of several algorithms are\u0000studied depending on the degree of data discretization, the level and type of noise introduced into\u0000the data, the smoothness of the vector field, and the degree of connectivity of its support.\u0000Numerical simulations show good results of reconstructing vector fields from their momentum ray\u0000transforms.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"860 - 874"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Decomposition Approach for a Two-Echelon InventoryManagement System 双层库存管理系统的分解方法
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040239
A. D. Yuskov, I. N. Kulachenko, A. A. Melnikov, Yu. A. Kochetov
{"title":"Decomposition Approach for a Two-Echelon Inventory\u0000Management System","authors":"A. D. Yuskov,&nbsp;I. N. Kulachenko,&nbsp;A. A. Melnikov,&nbsp;Yu. A. Kochetov","doi":"10.1134/S1990478924040239","DOIUrl":"10.1134/S1990478924040239","url":null,"abstract":"<p> Warehouses of the first echelon in a two-echelon system are designed to satisfy customer\u0000orders. In the second echelon, we have a central warehouse for restocking the first-echelon\u0000warehouses. Customer orders can be partially satisfied, but the total fraction of completed orders\u0000should not be less than the specified threshold. We need to minimize the total cost of storing the\u0000items in all warehouses. We use a deterministic simulation to calculate the order satisfaction ratio\u0000and the storage cost during the planning period. The simulation depends on inventory\u0000management policies at each warehouse for each type of items. We develop a decomposition\u0000method for solving the problem. It is based on solution of subproblems for each type of items.\u0000Also, we propose some approaches to exact solution of the problem. The results of numerical\u0000experiments with instances with 100 warehouses and 1000 types of items are presented. On\u0000instances with known exact solutions, we have the optimum in two cases, while in the other cases\u0000the deviation from the optimal values is at most 1.9%.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"918 - 934"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Branch, Bound, and Cuts Algorithm for the DynamicCompetitive Facility Location Problem 动态竞争设施选址问题的分支、界和切算法
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040021
V. L. Beresnev, A. A. Melnikov
{"title":"A Branch, Bound, and Cuts Algorithm for the Dynamic\u0000Competitive Facility Location Problem","authors":"V. L. Beresnev,&nbsp;A. A. Melnikov","doi":"10.1134/S1990478924040021","DOIUrl":"10.1134/S1990478924040021","url":null,"abstract":"<p> We consider a dynamic competitive facility location problem modeling an interaction of\u0000two competing parties (Leader and Follower) who place their facilities within a planning horizon\u0000split into several time periods. The Leader is assumed to open his/her facilities at the beginning\u0000of the planning horizon and does not change his/her decision later, while the Follower can modify\u0000his/her choice within each time period. We propose an algorithm that computes the best Leader’s\u0000decision and is built on the base of the branch-and-bound computational scheme. To compute\u0000upper bounds, a special relaxation of the initial bilevel problem strengthened with additional\u0000constraints (cuts) is used. The paper describes the construction of these constraints while utilizing\u0000auxiliary optimization problems; this provides the strongest cuts. On an instance of a dynamic\u0000competitive facility location on a network with three vertices, we demonstrate that the model is\u0000capable to take into account information regarding the changes of problem’s parameters along\u0000the time period. An implementation of the branch-and-bound algorithm shows a significant\u0000benefit from using the cuts specially designed for dynamic competitive models: it improves the\u0000upper bound’s quality and reduces the number of nodes in the branching tree.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"643 - 655"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modeling of Wave Propagation in a Blocky Medium with ThinViscoelastic Interlayers in a Spatial Setting 空间环境下具有薄粘弹性夹层的块状介质中的波传播建模
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040033
E. A. Efimov
{"title":"Modeling of Wave Propagation in a Blocky Medium with Thin\u0000Viscoelastic Interlayers in a Spatial Setting","authors":"E. A. Efimov","doi":"10.1134/S1990478924040033","DOIUrl":"10.1134/S1990478924040033","url":null,"abstract":"<p> A three-dimensional model of a blocky medium with elastic blocks and thin elastic and\u0000viscoelastic interlayers is considered. The interlayers are described by simplified\u0000differential-difference relations. A numerical algorithm for solving dynamical problems based on\u0000splitting method is presented. The results of simulation of wave propagation in blocky half-space\u0000are presented. We compare the behaviour of surface waves arising in a blocky layered medium and\u0000in a discrete periodic medium consisting of rigid masses connected to each other by elastic springs.\u0000Results of computations using the proposed model are in good agreement with the experimental\u0000data.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"656 - 668"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Numerical Modeling of the Induction Logging Signalin Anisotropic Oil and Gas Reservoirswith a Layered Structure 各向异性层状油气藏感应测井信号数值模拟
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI: 10.1134/S1990478924040045
M. I. Epov, E. P. Shurina, D. A. Arkhipov, D. V. Dobrolyubova, N. V. Shtabel’, E. I. Shtan’ko
{"title":"Numerical Modeling of the Induction Logging Signal\u0000in Anisotropic Oil and Gas Reservoirs\u0000with a Layered Structure","authors":"M. I. Epov,&nbsp;E. P. Shurina,&nbsp;D. A. Arkhipov,&nbsp;D. V. Dobrolyubova,&nbsp;N. V. Shtabel’,&nbsp;E. I. Shtan’ko","doi":"10.1134/S1990478924040045","DOIUrl":"10.1134/S1990478924040045","url":null,"abstract":"<p> The aim of this work is to analyze the effect of the anisotropic nature of the electric\u0000conductivity in an oil-bearing formation on the induction logging signal. The numerical modeling\u0000of the logging signal from a device consisting of an alternating current excitation coil and two\u0000receiving coils moved along the wellbore is carried out. The electromotive force induced in the\u0000receiving coils is investigated. The electric conductivity of the oil-bearing formation is\u0000characterized by either a diagonal tensor with dominant\u0000<span>( sigma _{xx} )</span>,\u0000<span>( sigma _{yy} )</span> components or a dense tensor obtained by rotation to a specified zenith\u0000angle. Numerical modeling is performed with the vector finite element method on an adaptive\u0000unstructured tetrahedral grid taking into account the geometry of the logging device, vertical well,\u0000and layered host medium. The tensor electric conductivity is plugged into the variational\u0000formulation. Dependences of the apparent electric conductivity of the depth are obtained based on\u0000the electromotive force induced in the receiving coils.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"669 - 678"},"PeriodicalIF":0.58,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145143112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信