Applied Mathematics and Computation最新文献

{"title":"Decoupled bound-preserving algorithms for compressible Darcy-Brinkman flow with advection-diffusion transport problem in fractured media","authors":"Wei Liu,&nbsp;Kai Li","doi":"10.1016/j.amc.2025.129298","DOIUrl":"10.1016/j.amc.2025.129298","url":null,"abstract":"<div><div>A coupling of compressible Darcy-Brinkman flow and advection-diffusion transport problem is considered in fractured media. Treating the fracture as hyperplane, we obtain a two-layer reduced coupled model and the whole considered media is divided into low dimensional fracture-interfaces and surrounding high dimensional subdomains. To improve efficiency, two decoupled algorithms are constructed to solve the reduced coupled model. One decoupled algorithm is proposed based on interpolating vectors as inner boundaries and the other is constructed by interpolating scalars as iterative terms. By using both algorithms, the models in each subdomain are solved in parallel. The BDF2 formula and modified upwind scheme are employed to maintain the accuracy. For advection-diffusion model, we develop a novel bound-preserving scheme to keep the concentration within <span><math><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></math></span> combined with finite volume method by the Lagrange multiplier approach. The accuracy and efficiency of the proposed algorithms are verified by numerical experiments including three-dimensional case and benchmark testing.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129298"},"PeriodicalIF":3.5,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"k-path-edge-connectivity of the complete balanced bipartite graph","authors":"Yaoping Wang,&nbsp;Shasha Li,&nbsp;Zeng Zhao","doi":"10.1016/j.amc.2025.129295","DOIUrl":"10.1016/j.amc.2025.129295","url":null,"abstract":"<div><div>Given a graph <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></math></span> and a set <span><math><mi>S</mi><mo>⊆</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> with <span><math><mo>|</mo><mi>S</mi><mo>|</mo><mo>≥</mo><mn>2</mn></math></span>, an <em>S-path</em> in <em>G</em> is a path that connects all vertices of <em>S</em>. Let <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span> represent the maximum number of edge-disjoint <em>S</em>-paths in <em>G</em>. The <em>k-path-edge-connectivity</em> <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math></span> of <em>G</em> is then defined as min<span><math><mo>{</mo><msub><mrow><mi>ω</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo><mo>:</mo><mi>S</mi><mo>⊆</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mspace></mspace><mi>a</mi><mi>n</mi><mi>d</mi><mspace></mspace><mo>|</mo><mi>S</mi><mo>|</mo><mo>=</mo><mi>k</mi><mo>}</mo></math></span>, where <span><math><mn>2</mn><mo>≤</mo><mi>k</mi><mo>≤</mo><mo>|</mo><mi>V</mi><mo>|</mo></math></span>. Therefore, <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math></span> is precisely the edge-connectivity <span><math><mi>λ</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>. In this paper, we focus on the <em>k</em>-path-edge-connectivity of the complete balanced bipartite graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>n</mi></mrow></msub></math></span> for all <span><math><mn>3</mn><mo>≤</mo><mi>k</mi><mo>≤</mo><mn>2</mn><mi>n</mi></math></span>. We show that if <span><math><mi>k</mi><mo>=</mo><mi>n</mi></math></span> or <span><math><mi>k</mi><mo>=</mo><mi>n</mi><mo>+</mo><mn>1</mn></math></span>, and <em>n</em> is odd, then <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>n</mi></mrow></msub><mo>)</mo><mo>=</mo><mo>⌊</mo><mfrac><mrow><mi>n</mi><mi>k</mi></mrow><mrow><mn>2</mn><mo>(</mo><mi>k</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow></mfrac><mo>⌋</mo><mo>−</mo><mn>1</mn></math></span>; otherwise, <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>n</mi></mrow></msub><mo>)</mo><mo>=</mo><mo>⌊</mo><mfrac><mrow><mi>n</mi><mi>k</mi></mrow><mrow><mn>2</mn><mo>(</mo><mi>k</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow></mfrac><mo>⌋</mo></math></span>.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129295"},"PeriodicalIF":3.5,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"1-Planar graphs with no 5-cycles are 5-degenerate","authors":"Qingqin Wu ,&nbsp;Weifan Wang ,&nbsp;Jiangxu Kong","doi":"10.1016/j.amc.2025.129304","DOIUrl":"10.1016/j.amc.2025.129304","url":null,"abstract":"<div><div>A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. A graph is <em>k</em>-degenerate if each of its subgraphs contains a vertex of degree no greater than <em>k</em>. It was known that 1-planar graphs are 7-degenerate. In this paper, we show that every 1-planar graph without 5-cycles is 5-degenerate, which extends some known results on the 5-degeneracy of some 1-planar graphs.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129304"},"PeriodicalIF":3.5,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Interval-oriented reduced-order model for uncertain control systems","authors":"Ziyao Fan ,&nbsp;Chen Yang","doi":"10.1016/j.amc.2025.129299","DOIUrl":"10.1016/j.amc.2025.129299","url":null,"abstract":"<div><div>The reduced-order model (ROM), as a crucial research avenue in control system design, effectively simplifies complexity and enhances computational efficiency when handling high-dimensional models. However, considering the presence of uncertainties caused by the incompleteness of the system model and the errors induced by sensors, conventional probabilistic methods rely on a substantial number of samples and may struggle to be applicable when there is an insufficient quantity of samples available. To address this challenge, this paper presents an interval-oriented reduced-order model (IROM) tailored for uncertain linear systems, aiming to improve the accuracy of the uncertain reduced-order model under small-sample conditions. Based on the unknown but bounded parameters, the interval state-space equations are established, and transformed into interval balanced equations. The uncertainty bounds for controllability and observability matrices, as well as Hankel singular values, are obtained via interval Lyapunov equations and an interval perturbation-based singular value decomposition method. Considering the dense distributions of uncertain Hankel singular values, a novel interval truncation criterion is introduced to determine the reduced model order. After order selection using the optimization method, the reduced-order models and output predictions can be obtained. Two application examples are provided to demonstrate the accuracy and efficiency of the developed methodology.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129299"},"PeriodicalIF":3.5,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Fan-type condition for cycles in 1-tough and k-connected (P2 ∪ kP1)-free graphs","authors":"Zhiquan Hu,&nbsp;Jie Wang,&nbsp;Changlong Shen","doi":"10.1016/j.amc.2025.129300","DOIUrl":"10.1016/j.amc.2025.129300","url":null,"abstract":"<div><div>For a graph <em>G</em>, define <span><math><msub><mrow><mi>μ</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo><mo>:</mo><mo>=</mo><mi>min</mi><mo>⁡</mo><mspace></mspace><mo>{</mo><msub><mrow><mi>max</mi></mrow><mrow><mi>x</mi><mo>∈</mo><mi>S</mi></mrow></msub><mo>⁡</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>:</mo><mspace></mspace><mi>S</mi><mo>∈</mo><msub><mrow><mi>S</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>}</mo></math></span>, where <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span> is the set consisting of all independent sets <span><math><mo>{</mo><msub><mrow><mi>u</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>u</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>}</mo></math></span> of <em>G</em> such that some vertex, say <span><math><msub><mrow><mi>u</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> (<span><math><mn>1</mn><mo>≤</mo><mi>i</mi><mo>≤</mo><mi>k</mi></math></span>), is at distance two from every other vertex in it. A graph <em>G</em> is called 1-tough if for each cut set <span><math><mi>S</mi><mo>⊆</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>, <span><math><mi>G</mi><mo>−</mo><mi>S</mi></math></span> has no more than <span><math><mo>|</mo><mi>S</mi><mo>|</mo></math></span> components. Recently, Shi and Shan <span><span>[19]</span></span> conjectured that for each integer <span><math><mi>k</mi><mo>≥</mo><mn>4</mn></math></span>, being 2<em>k</em>-connected is sufficient for 1-tough <span><math><mo>(</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>∪</mo><mi>k</mi><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo></math></span>-free graphs to be hamiltonian, which was confirmed by Xu et al. <span><span>[20]</span></span> and Ota and Sanka <span><span>[16]</span></span>, respectively. In this article, we generalize the above results through the following Fan-type theorem: If <em>G</em> is a 1-tough and <em>k</em>-connected <span><math><mo>(</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>∪</mo><mi>k</mi><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo></math></span>-free graph and satisfies <span><math><msub><mrow><mi>μ</mi></mrow><mrow><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo><mo>≥</mo><mfrac><mrow><mn>7</mn><mi>k</mi><mo>−</mo><mn>6</mn></mrow><mrow><mn>5</mn></mrow></mfrac></math></span>, where <span><math><mi>k</mi><mo>≥</mo><mn>2</mn></math></span> is an integer, then <em>G</em> is hamiltonian or the Petersen graph.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"494 ","pages":"Article 129300"},"PeriodicalIF":3.5,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The outerplanar Turán number of disjoint copies of paths","authors":"Jin Li ,&nbsp;Yongxin Lan ,&nbsp;Changqing Xu","doi":"10.1016/j.amc.2025.129296","DOIUrl":"10.1016/j.amc.2025.129296","url":null,"abstract":"<div><div>A graph without a copy of <em>T</em> as a subgraph is called <em>T</em>-free. The outerplanar Turán number <span><math><mi>e</mi><msub><mrow><mi>x</mi></mrow><mrow><msub><mrow></mrow><mrow><mi>O</mi><mi>P</mi></mrow></msub></mrow></msub><mo>(</mo><mi>n</mi><mo>,</mo><mi>T</mi><mo>)</mo></math></span> of <em>T</em> represents the maximum number of edges among all <em>n</em>-vertex <em>T</em>-free outerplanar graphs. In this paper, we investigate <span><math><mi>e</mi><msub><mrow><mi>x</mi></mrow><mrow><msub><mrow></mrow><mrow><mi>O</mi><mi>P</mi></mrow></msub></mrow></msub><mo>(</mo><mi>n</mi><mo>,</mo><mi>r</mi><msub><mrow><mi>P</mi></mrow><mrow><mi>s</mi></mrow></msub><mo>)</mo></math></span> and determine its exact value for <span><math><mi>r</mi><mo>,</mo><mi>s</mi><mo>≥</mo><mn>2</mn></math></span> and <span><math><mi>n</mi><mo>≥</mo><mi>r</mi><mi>s</mi></math></span>. This extends a result of Fang and Zhai (2023) <span><span>[7]</span></span>.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"494 ","pages":"Article 129296"},"PeriodicalIF":3.5,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Calculating the C-eigenvalues of the three-dimensional piezoelectric tensors directly","authors":"Huage Wang","doi":"10.1016/j.amc.2024.129269","DOIUrl":"10.1016/j.amc.2024.129269","url":null,"abstract":"<div><div>In this paper, we derive explicit expressions to directly determine the C-eigenvalues and corresponding C-eigenvectors of the three-dimensional piezoelectric tensors through categorical discussions. We further validate the efficacy of this approach by solving the eigenvalues of three classic three-dimensional piezoelectric tensors using this method.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"494 ","pages":"Article 129269"},"PeriodicalIF":3.5,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Graphs whose the maximum size of an odd subgraph equal to ⌊n2⌋","authors":"Si-Ao Xu,&nbsp;Baoyindureng Wu","doi":"10.1016/j.amc.2025.129297","DOIUrl":"10.1016/j.amc.2025.129297","url":null,"abstract":"<div><div>A graph is said to be odd if the degrees of all vertices are odd. A subgraph <em>F</em> of <em>X</em> is called an odd factor of <em>X</em> if <em>F</em> is odd and <span><math><mi>V</mi><mo>(</mo><mi>F</mi><mo>)</mo><mo>=</mo><mi>V</mi><mo>(</mo><mi>X</mi><mo>)</mo></math></span>. Let <span><math><msubsup><mrow><mi>f</mi></mrow><mrow><mi>o</mi></mrow><mrow><mo>′</mo></mrow></msubsup><mo>(</mo><mi>X</mi><mo>)</mo><mo>=</mo><mi>max</mi><mo>⁡</mo><mo>{</mo><mo>|</mo><mi>S</mi><mo>|</mo><mo>:</mo><mi>S</mi><mo>⊆</mo><mi>E</mi><mo>(</mo><mi>X</mi><mo>)</mo><mo>,</mo><mi>X</mi><mo>[</mo><mi>S</mi><mo>]</mo><mtext> is odd</mtext><mo>}</mo></math></span> and <span><math><msubsup><mrow><mi>f</mi></mrow><mrow><mi>o</mi></mrow><mrow><mo>″</mo></mrow></msubsup><mo>(</mo><mi>X</mi><mo>)</mo><mo>=</mo><mi>max</mi><mo>⁡</mo><mo>{</mo><mo>|</mo><mi>S</mi><mo>|</mo><mo>:</mo><mi>S</mi><mo>⊆</mo><mi>E</mi><mo>(</mo><mi>X</mi><mo>)</mo><mo>,</mo><mi>X</mi><mo>[</mo><mi>S</mi><mo>]</mo><mtext> is an odd factor of </mtext><mi>X</mi><mo>}</mo></math></span>. In 2001, Scott established that every connected graph <em>X</em> of even order admits a vertex partition <span><math><msub><mrow><mi>A</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>s</mi></mrow></msub></math></span> such that the induced graph <span><math><mi>X</mi><mo>[</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>]</mo></math></span> is odd for <span><math><mi>i</mi><mo>∈</mo><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>s</mi><mo>}</mo></math></span>. It implies that for a graph of order <em>n</em>, <span><math><msubsup><mrow><mi>f</mi></mrow><mrow><mi>o</mi></mrow><mrow><mo>′</mo></mrow></msubsup><mo>(</mo><mi>X</mi><mo>)</mo><mo>≥</mo><mo>⌊</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac><mo>⌋</mo></math></span>, and <span><math><msubsup><mrow><mi>f</mi></mrow><mrow><mi>o</mi></mrow><mrow><mo>″</mo></mrow></msubsup><mo>(</mo><mi>X</mi><mo>)</mo><mo>≥</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> if <em>n</em> is even. In this paper, first we characterize all trees <em>T</em> with the property that <span><math><mi>T</mi><mo>−</mo><mi>v</mi></math></span> has a perfect matching for any leaf <em>v</em>. Thereby, we comprehensively characterize all connected graphs that attain the tight lower bounds for <span><math><msubsup><mrow><mi>f</mi></mrow><mrow><mi>o</mi></mrow><mrow><mo>′</mo></mrow></msubsup><mo>(</mo><mi>X</mi><mo>)</mo></math></span> and <span><math><msubsup><mrow><mi>f</mi></mrow><mrow><mi>o</mi></mrow><mrow><mo>″</mo></mrow></msubsup><mo>(</mo><mi>X</mi><mo>)</mo></math></span> respectively.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"494 ","pages":"Article 129297"},"PeriodicalIF":3.5,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Carleman-Picard approach for reconstructing zero-order coefficients in parabolic equations with limited data","authors":"Ray Abney ,&nbsp;Thuy T. Le ,&nbsp;Loc H. Nguyen ,&nbsp;Cam Peters","doi":"10.1016/j.amc.2025.129286","DOIUrl":"10.1016/j.amc.2025.129286","url":null,"abstract":"<div><div>We propose a globally convergent computational technique for the nonlinear inverse problem of reconstructing the zero-order coefficient in a parabolic equation using partial boundary data. This technique is called the “reduced dimensional method.” Initially, we use the polynomial-exponential basis to approximate the inverse problem as a system of 1D nonlinear equations. We then employ a Picard iteration based on the quasi-reversibility method and a Carleman weight function. We will rigorously prove that the sequence derived from this iteration converges to the accurate solution for that 1D system without requesting a good initial guess of the true solution. The key tool for the proof is a Carleman estimate. We will also show some numerical examples.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"494 ","pages":"Article 129286"},"PeriodicalIF":3.5,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Integrated mobile facility production and distribution scheduling planning; A synchronized solution framework","authors":"Reza Ramezanian ,&nbsp;Mohammad Hosein Mahdavi ,&nbsp;Shahrooz Shahparvari","doi":"10.1016/j.amc.2025.129277","DOIUrl":"10.1016/j.amc.2025.129277","url":null,"abstract":"<div><div>This research explores supply chain modeling for mobile production facilities, emphasizing distribution and manufacturing processes. The focus is on a fleet of production-equipped trucks that manufacture orders during transit to customer locations. A mixed-integer linear programming (MILP) model is proposed to address the production and delivery planning problem, minimizing total costs, including production, transportation, and driver expenses. The computational strategy integrates Benders Decomposition with a Rolling Horizon heuristic. The accelerated Benders Decomposition reduced computational time by 25–35 % across large-scale scenarios. Numerical experiments demonstrated that the hybrid method achieved optimal or near-optimal solutions with cost savings of 12–18 % compared to standalone methods. For example, in scenarios with 15 mobile facilities and 10 products, the methodology outperformed CPLEX in solution time and quality. The results highlight the practical applicability of the proposed framework, enabling e-commerce enterprises to enhance customer service levels by reducing delivery times by 10–15 %. This study provides a robust and efficient approach to optimizing synchronized production and delivery operations while eliminating the costs associated with fixed manufacturing facilities.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"494 ","pages":"Article 129277"},"PeriodicalIF":3.5,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}