发布求助
文献互助 智能选刊 最新文献

Journal of Applied and Industrial Mathematics最新文献

筛选
英文 中文
A model of International Trade with R&D Investmentunder Monopolistic Competition: Equilibriumin Autarky Situation 垄断竞争下具有研发投资的国际贸易模型：自给均衡
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2026-04-01 DOI: 10.1134/S1990478925020024
I. A. Bykadorov
{"title":"A model of International Trade with R&D Investment\u0000under Monopolistic Competition: Equilibrium\u0000in Autarky Situation","authors":"I. A. Bykadorov","doi":"10.1134/S1990478925020024","DOIUrl":"10.1134/S1990478925020024","url":null,"abstract":"<p> The article studies a model of international trade between two countries under\u0000monopolistic competition of producers. The utility functions of consumers are additively\u0000separable. Transport costs are of the iceberg type. The production cost function is nonlinear:\u0000marginal costs are a decreasing function of R&amp;D investments. The article considers market\u0000equilibrium in autarky situation, when transport costs are so high that international trade ceases.\u0000Comparative statics is carried out on transport costs of equilibrium variables (individual\u0000consumption, size and mass of firms, and prices), as well as social welfare.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 2","pages":"212 - 229"},"PeriodicalIF":0.58,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147579347","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
Drone Placement for Optimal Barrier Coverage 无人机放置的最佳屏障覆盖
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2026-04-01 DOI: 10.1134/S1990478925020036
A. I. Erzin, A. V. Shadrina
{"title":"Drone Placement for Optimal Barrier Coverage","authors":"A. I. Erzin,&nbsp;A. V. Shadrina","doi":"10.1134/S1990478925020036","DOIUrl":"10.1134/S1990478925020036","url":null,"abstract":"<p> A line segment (barrier) is specified on the plane, as well as the location of depots. Each\u0000sensor is able to travel a limited-length path, starting and ending at its depot. The part of the\u0000barrier along which the sensor moves is <i>covered</i> by this\u0000sensor. It is necessary to place some number of mobile sensors (drones) in each depot in order to\u0000cover the entire barrier with a minimum number of drones (<span>MinNum</span>), or to minimize the total length of\u0000paths traveled by drones (<span>MinSum</span>),\u0000or to minimize the maximum distance traveled by a drone (<span>MinMax</span>).\u0000</p><p>Previously, the authors investigated a similar problem with an unlimited number\u0000of drones and, for its solution, proposed a pseudopolynomial algorithm depending on the length of\u0000the barrier L. In this paper, a generalized problem with a limited number of drones is considered\u0000and, to construct an optimal solution, we propose an algorithm with the same complexity.\u0000However, in the case of an unlimited number of drones, the new algorithm has complexity\u0000<span>( L )</span> times less than the previous one.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 2","pages":"230 - 239"},"PeriodicalIF":0.58,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147579349","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
An Integer Model with Optimality Conditions for the TotalWeighted Minimizing Problemon a Single Machine 单机总加权最小问题的带最优条件的整数模型
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2026-04-01 DOI: 10.1134/S1990478925020127
R. Yu. Simanchev, I. V. Urazova
{"title":"An Integer Model with Optimality Conditions for the Total\u0000Weighted Minimizing Problem\u0000on a Single Machine","authors":"R. Yu. Simanchev,&nbsp;I. V. Urazova","doi":"10.1134/S1990478925020127","DOIUrl":"10.1134/S1990478925020127","url":null,"abstract":"<p> The paper considers the following problem of scheduling theory. Jobs are serviced by\u0000a single machine. Each job is characterized by a positive weight and a release date. The service\u0000durations are the same. Interruptions are allowed in service. Time is assumed to be discrete. It is\u0000necessary to find a schedule for servicing jobs that minimizes the weighted sum of moments of\u0000completion of processing jobs. The complexity status of the problem is currently unknown. The\u0000paper presents a new Boolean linear programming model for this problem that includes some\u0000necessary conditions for the optimality of schedules. These conditions are presented as linear\u0000inequalities. As a result of the computational experiment, it was noted that the model produces\u0000an integer solution even without imposing integer conditions on the variables.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 2","pages":"348 - 355"},"PeriodicalIF":0.58,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147579361","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 Two-Stage Algorithm for the Dynamic Bin Packing Problemwith Placement Groups 带放置群的动态装箱问题的两阶段算法
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-11-02 DOI: 10.1134/S1990478925010090
A. V. Ratushnyi, Y. A. Kochetov
{"title":"A Two-Stage Algorithm for the Dynamic Bin Packing Problem\u0000with Placement Groups","authors":"A. V. Ratushnyi,&nbsp;Y. A. Kochetov","doi":"10.1134/S1990478925010090","DOIUrl":"10.1134/S1990478925010090","url":null,"abstract":"<p> A new dynamic bin packing problem relevant to cloud computing is considered. The\u0000creation time, deletion time, and required resources are known for each item (virtual machine).\u0000The containers (servers) have a NUMA architecture and specific rules for placing the machines.\u0000The servers are grouped into racks, and some machines form groups. Each group is divided into\u0000partitions. Machines from different partitions cannot be placed on the same rack to ensure system\u0000fault tolerance. The objective is to pack all the machines into the minimum number of racks over\u0000a given planning horizon. A two-stage algorithm is developed to solve the problem: an initial\u0000solution is constructed, where some constraints may be violated, followed by iterative\u0000improvement using local search aimed at eliminating the violations. Using the proposed approach,\u0000an average deviation of 3.8% from the lower bound was achieved on open test cases.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 1","pages":"92 - 103"},"PeriodicalIF":0.58,"publicationDate":"2025-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145425979","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 Decomposition Approach to a Stadium Antenna DeploymentProblem 体育场天线部署问题的分解方法
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-11-02 DOI: 10.1134/S1990478925010144
A. D. Yuskov
{"title":"A Decomposition Approach to a Stadium Antenna Deployment\u0000Problem","authors":"A. D. Yuskov","doi":"10.1134/S1990478925010144","DOIUrl":"10.1134/S1990478925010144","url":null,"abstract":"<p> We consider a stadium antenna deployment problem. The stadium is divided into sectors.\u0000Several antennas are assigned to each sector. Users should receive a signal of a certain quality\u0000from antennas assigned to their sector. The problem is to choose locations of antennas, their\u0000types, angles, and assignments to sectors to maximize three quality criteria: the mean signal to\u0000interference ratio (SIR), the number of clients with good signal quality, and the assignment\u0000consistency. We use a simulation to compute the signal quality. We present a three-stage heuristic\u0000approach to the problem. It uses a constructive heuristic, a local improvement procedure, and\u0000a decomposition-based MIP heuristic. We carry out numerical experiments on test instances with\u000094 antennas of 7 types, 19 sectors, and 4426 clients. It is possible to improve the provided baseline\u0000solutions in 2 h and obtain solutions comparable to running a metaheuristic package for 24 h.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 1","pages":"169 - 180"},"PeriodicalIF":0.58,"publicationDate":"2025-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145425984","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
Nonclassical Problem for Transverse Vibrationsof a String System 弦系统横向振动的非经典问题
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-11-02 DOI: 10.1134/S1990478925010065
D. S. Konovalova
{"title":"Nonclassical Problem for Transverse Vibrations\u0000of a String System","authors":"D. S. Konovalova","doi":"10.1134/S1990478925010065","DOIUrl":"10.1134/S1990478925010065","url":null,"abstract":"<p> The paper considers the transverse vibrations of two strings connected to each other at a\u0000certain point. A mathematical model of this process, based on the law of conservation of\u0000momentum, expressed in the form of an integro-differential equation is constructed. This equation\u0000connects the deviations of the strings during vibrations with their characteristics such as density,\u0000tension, and sources of external forces. This approach can be considered as a development of the\u0000method proposed by A.N. Tikhonov for the equation of string vibrations with nonsmooth data.\u0000For the case where the densities of the strings are constants, we set a nonclassical problem for the\u0000integro-differential equation. In addition to the Cauchy data, the problem includes necessary\u0000matching conditions. A theorem on the existence and uniqueness of a solution to the problem is\u0000proved, and explicit formulas are obtained for its solution.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 1","pages":"59 - 66"},"PeriodicalIF":0.58,"publicationDate":"2025-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145425987","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
Personal Sound Zones and Shielded Localized Communicationthrough Active Acoustic Control 通过主动声学控制的个人声音区域和屏蔽局部通信
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-11-02 DOI: 10.1134/S1990478925010028
N. J. A. Egarguin, D. Onofrei
{"title":"Personal Sound Zones and Shielded Localized Communication\u0000through Active Acoustic Control","authors":"N. J. A. Egarguin,&nbsp;D. Onofrei","doi":"10.1134/S1990478925010028","DOIUrl":"10.1134/S1990478925010028","url":null,"abstract":"<p> In this paper, we present a time domain extension of our strategy on manipulating\u0000radiated scalar Helmholtz fields and discuss two important applied scenarios, namely (1) creating\u0000personal sound zones inside a bounded domain and (2) shielded localized communication. Our\u0000strategy is based on the authors’ previous works establishing the possibility and stability of\u0000controlling acoustic fields using an array of almost non-radiating coupling sources and presents a\u0000detailed Fourier synthesis approach towards a time-domain effect. We require that the array of\u0000acoustic sources creates the desired fields on the control regions while maintaining a zero field\u0000beyond a larger circumscribed sphere. This paper recalls the main theoretical results then presents\u0000the underlying Fourier synthesis paradigm and show, through relevant simulations, the\u0000performance of our strategy.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 1","pages":"7 - 32"},"PeriodicalIF":0.58,"publicationDate":"2025-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145425994","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
On One Optimization Problemfor Warehouse Goods Placement 仓库货物放置的一个优化问题
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-11-02 DOI: 10.1134/S1990478925010089
K. O. Motorin, A. V. Pyatkin
{"title":"On One Optimization Problem\u0000for Warehouse Goods Placement","authors":"K. O. Motorin,&nbsp;A. V. Pyatkin","doi":"10.1134/S1990478925010089","DOIUrl":"10.1134/S1990478925010089","url":null,"abstract":"<p> A warehouse goods placement problem is considered, where the aim is to minimize the\u0000total time of fulfillment of orders from a given list. NP-hardness of this problem even in\u0000the simplest special case is proved. An ILP model is suggested for this problem. Two heuristic\u0000algorithms are developed for solving this problem; their effectiveness is analyzed using randomly\u0000generated instances.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 1","pages":"77 - 91"},"PeriodicalIF":0.58,"publicationDate":"2025-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145425985","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
Universal Cycles That Generate All Graphs of CoalitionPartitions in Cycles 生成循环中所有联合分区图的通用循环
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-11-02 DOI: 10.1134/S199047892501003X
A. N. Glebov, A. A. Dobrynin
{"title":"Universal Cycles That Generate All Graphs of Coalition\u0000Partitions in Cycles","authors":"A. N. Glebov,&nbsp;A. A. Dobrynin","doi":"10.1134/S199047892501003X","DOIUrl":"10.1134/S199047892501003X","url":null,"abstract":"<p> A <i>coalition</i> in a graph\u0000<span>( G )</span> is a pair of disjoint nondominating subsets of its vertices\u0000<span>( V_1, V_2 subset V(G) )</span> such that\u0000<span>( V_1cup V_2 )</span> is a dominating set. In the coalition partition\u0000<span>( pi (G)={ V_1,V_2,dots ,V_k } )</span>, every nondominating set\u0000<span>( V_i )</span> is included in some coalition and if\u0000<span>( V_i )</span> is dominating, then it is a single-vertex set. A coalition partition of vertices\u0000of a graph\u0000<span>( G )</span> generates a coalition graph\u0000<span>( text {CG}(G,pi ) )</span> whose vertices correspond to the partition sets, while two vertices are\u0000adjacent if the corresponding sets form a coalition. It is well known that all simple cycles of order\u0000greater than three generate in total 26 coalition graphs of order at most six. A universal cycle\u0000generates all such graphs. It is shown that only the cycles\u0000<span>( C_{3k} )</span>,\u0000<span>( k ge 5 )</span>, are universal.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 1","pages":"33 - 39"},"PeriodicalIF":0.58,"publicationDate":"2025-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145425982","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
On the Influence of Disturbances on the Accuracy of ComputingCorrections in the Krylov Subspace 干扰对Krylov子空间中计算修正精度的影响
IF 0.58
Journal of Applied and Industrial Mathematics Pub Date : 2025-11-02 DOI: 10.1134/S1990478925010053
V. P. Ilyin, V. N. Babenko
{"title":"On the Influence of Disturbances on the Accuracy of Computing\u0000Corrections in the Krylov Subspace","authors":"V. P. Ilyin,&nbsp;V. N. Babenko","doi":"10.1134/S1990478925010053","DOIUrl":"10.1134/S1990478925010053","url":null,"abstract":"<p> Rounding errors inevitably occur when performing calculations on a computer. In this\u0000paper, we study the impact of these errors on the accuracy of calculating the correction in the\u0000Krylov subspace. An estimate of the accuracy of the calculated correction, expressed via\u0000perturbations of the original data, is obtained.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"19 1","pages":"51 - 58"},"PeriodicalIF":0.58,"publicationDate":"2025-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145425986","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学术官方微信
小红书