Skip to Content

2,724 Results Found

  • Article
  • Open Access
6 Citations
3,144 Views
18 Pages

Decomposition of the Knapsack Problem for Increasing the Capacity of Operating Rooms

  • Alexander Alekseevich Lazarev,
  • Darya Vladimirovna Lemtyuzhnikova and
  • Mikhail Lvovich Somov

1 March 2022

This paper is aimed at the problem of scheduling surgeries in operating rooms. To solve this problem, we suggest using some variation of the bin packing problem. The model is based on the actual operation of 10 operating rooms, each of which belongs...

(This article belongs to the Special Issue Recent Advances of Disсrete Optimization and Scheduling)
  • Article
  • Open Access
1,239 Views
11 Pages

Decomposition Algorithm for a Nonlinear Three-Index Transportation Problem

  • Vladimir Lobantsov,
  • Alexander Tizik,
  • Vladimir Tsurkov and
  • Ivan Matveev

12 March 2025

A three-index transportation problem is considered, where the indices stand for supplier, consumer, and type of product. A quite broad statement is allowed, including additional points of production, consumption, and nonlinear transportation costs th...

(This article belongs to the Special Issue Innovations in Optimization and Operations Research)
  • Feature Paper
  • Article
  • Open Access
12 Citations
4,119 Views
28 Pages

16 November 2022

Modern computational mathematics and informatics for Digital Environments deal with the high dimensionality when designing and optimizing models for various real-world phenomena. Large-scale global black-box optimization (LSGO) is still a hard proble...

(This article belongs to the Special Issue Applied and Computational Mathematics for Digital Environments)
  • Article
  • Open Access
5 Citations
3,040 Views
15 Pages

A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell

  • Mohammad Reza Komari Alaei,
  • Mehmet Soysal,
  • Atabak Elmi,
  • Audrius Banaitis and ,
  • Nerija Banaitiene,
  • Reza Rostamzadeh and
  • Shima Javanmard
  • + 2 authors+ 0 author

22 July 2021

The present research addresses the single transportation robot used to alleviate problems of robotic cell scheduling of the machines. For the purpose of minimizing the make-span, a model of mixed-integer linear programming (MILP) has been suggested....

  • Article
  • Open Access
3 Citations
3,040 Views
16 Pages

18 September 2020

Independent System Operators (ISOs) worldwide face the ever-increasing challenge of coping with uncertainties, which requires sophisticated algorithms for solving unit-commitment (UC) problems of increasing complexity in less-and-less time. Hence, de...

(This article belongs to the Special Issue Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov)
  • Article
  • Open Access
24 Citations
6,162 Views
30 Pages

20 October 2022

Sustainable supply chains depend on three critical decisions: production, inventory management, and distribution with reverse flows. To achieve an effective level of operational performance, policymakers must consider all these decisions, especially...

(This article belongs to the Special Issue Advances in Operations and Supply Chain Management with Sustainability Considerations)
  • Article
  • Open Access
1 Citations
496 Views
27 Pages

A New One-Machine Decomposition Technique for Solving the Permutation Flow-Shop Scheduling Problem

  • Mehrdad Amirghasemi,
  • Stefan Voß,
  • Wolfgang Garn,
  • Amir Arjomandi and
  • Robert Ogie

13 July 2026

Existing metaheuristics for the permutation flow-shop scheduling problem primarily explore the search space directly. This study presents a new decomposition technique that, unlike those methods, repeatedly solves one-machine subproblems and extends...

  • Article
  • Open Access
6 Citations
2,372 Views
22 Pages

27 August 2024

In this paper, the quadratic p-median optimization problem is discussed, where the goal is to connect users to a selected group of facilities (emergency services, telecommunications servers, healthcare facilities) at the lowest possible cost. The pro...

(This article belongs to the Section A: Computer Science)
  • Article
  • Open Access
4 Citations
1,615 Views
9 Pages

7 December 2024

The Troesch problem is a well-known and important problem; the ability to solve it is important due to the practical applications of this problem. In this paper, we propose a method to solve this problem using a combination of two useful algorithms:...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
9 Citations
5,208 Views
14 Pages

13 March 2020

The history of boundary value problems for differential equations starts with the well-known studies of D. Bernoulli, J. D’Alambert, C. Sturm, J. Liouville, L. Euler, G. Birkhoff and V. Steklov. The greatest success in spectral theory of ordina...

  • Article
  • Open Access
12 Citations
3,552 Views
18 Pages

5 November 2020

Encouraging healthy and balanced diet plans is one of the most important action points for governments around the world. Generating healthy, balanced and inexpensive menu plans that fulfil all the recommendations given by nutritionists is a complex a...

(This article belongs to the Special Issue Evolutionary Computation 2020)
  • Article
  • Open Access
1 Citations
1,558 Views
11 Pages

Decomposition Method for Solving a System of Third-Order Boundary Value Problems

  • Muhammad Aslam Noor,
  • Khalida Inayat Noor and
  • Asif Waheed

1 December 2014

In this paper, we use the modified decomposition method for solving the system of third-order nonlinear boundary value problems associated with obstacle problems. Some examples of system of third-order nonlinear boundary value problems are given. The...

  • Article
  • Open Access
8 Citations
5,154 Views
18 Pages

11 October 2021

The paper presents the Generalized Benders Decomposition (GBD) method, which is now one of the basic approaches to solve big mixed-integer nonlinear optimization problems. It concentrates on the basic formulation with convex objectives and constraint...

(This article belongs to the Special Issue Mixed-Integer Linear and Nonlinear Programming Methods for Energy Aware Traffic Control in Stationary Networks and Clouds)
  • Article
  • Open Access
271 Views
19 Pages

Modified Decomposition Algorithms for Fractional Delay Boundary Value Problems

  • Mona Alsulami,
  • Mariam Al-Mazmumy and
  • Bashair Banweer

8 October 2026

This paper proposes two modified Adomian decomposition method-based algorithms for solving fractional delay boundary value problems. The algorithms effectively handle linear and nonlinear problems by constructing rapidly convergent series solutions u...

(This article belongs to the Special Issue Advances in Fractional-Order Difference and Differential Equations)
  • Article
  • Open Access
8 Citations
3,060 Views
15 Pages

27 September 2022

The present paper makes use of the efficient double decomposition method to propose a method for solving two-point boundary-value problems, featuring second- and higher-order nonlinear ordinary differential equations. The efficacy of the proposed met...

(This article belongs to the Section C1: Difference and Differential Equations)
  • Proceeding Paper
  • Open Access
1 Citations
899 Views
6 Pages

We study the decomposition of large-scale Quadratic Unconstrained Binary Optimization Problems (QUBO) formulations for quantum and quantum-inspired annealers and propose two decomposition mechanisms. The first is one-way-one-hot (1W1H), which replace...

(This article belongs to the Proceedings of The 7th Eurasia Conference on IoT, Communication and Engineering 2025 (ECICE 2025))
  • Article
  • Open Access
2 Citations
1,913 Views
24 Pages

1 September 2025

Covering problems constitute a central theme in facility location research. This study extends the classical Maximal Covering Location Problem (MCLP) and Partial Set Covering Location Problem (PSCLP) to their generalized variants, in which each deman...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
724 Views
13 Pages

25 November 2025

The current manuscript introduces an efficient modification scheme, based on the Adomian decomposition method, for the numerical solution of systems of two-point boundary-value problems. Indeed, this introduced method is characterized by high computa...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
2 Citations
3,229 Views
28 Pages

16 October 2022

The main purpose of the work was examining various methods of decomposition of a network optimization problem of simultaneous routing and bandwidth allocation based on Lagrangian relaxation. The problem studied is an NP-hard mixed-integer nonlinear o...

(This article belongs to the Special Issue Mixed-Integer Linear and Nonlinear Programming Methods for Energy Aware Traffic Control in Stationary Networks and Clouds)
  • Article
  • Open Access
7 Citations
3,842 Views
18 Pages

30 March 2021

This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation...

(This article belongs to the Special Issue Stochastic Algorithms and Their Applications)
  • Article
  • Open Access
5 Citations
3,930 Views
17 Pages

Benders Decomposition Method on Adjustable Robust Counterpart Optimization Model for Internet Shopping Online Problem

  • Diah Chaerani,
  • Shenya Saksmilena,
  • Athaya Zahrani Irmansyah,
  • Elis Hertini and ,
  • Endang Rusyaman and
  • Erick Paulus
  • + 1 author+ 0 author

In this paper, the implementation of the Benders decomposition method to solve the Adjustable Robust Counterpart for Internet Shopping Online Problem (ARC-ISOP) is discussed. Since the ARC-ISOP is a mixed-integer linear programming (MILP) model, the...

  • Article
  • Open Access
13 Citations
3,616 Views
21 Pages

Multi-Objective Neighborhood Search Algorithm Based on Decomposition for Multi-Objective Minimum Weighted Vertex Cover Problem

  • Shuli Hu,
  • Xiaoli Wu,
  • Huan Liu,
  • Yiyuan Wang and ,
  • Ruizhi Li and
  • Minghao Yin
  • + 1 author+ 0 author

2 July 2019

The multi-objective minimum weighted vertex cover problem aims to minimize the sum of different single type weights simultaneously. In this paper, we focus on the bi-objective minimum weighted vertex cover and propose a multi-objective algorithm inte...

  • Article
  • Open Access
13 Citations
5,380 Views
26 Pages

21 January 2022

This work addresses a particular case of the group shop scheduling problem (GSSP) which will be denoted as the fixed group shop scheduling problem (FGSSP). In a FGSSP, job operations are divided into stages and each stage has a set of machines associ...

(This article belongs to the Special Issue Mathematical Optimization and Evolutionary Algorithms with Applications)
  • Article
  • Open Access
2 Citations
1,880 Views
23 Pages

5 March 2024

We discuss several algorithms for solving a network optimization problem of simultaneous routing and bandwidth allocation in green networks in a decomposed way, based on the augmented Lagrangian. The problem is difficult due to the nonconvexity cause...

(This article belongs to the Section F3: Power Electronics)
  • Article
  • Open Access
4 Citations
1,629 Views
16 Pages

1 December 2010

In this paper, the existence and uniqueness theorems for a solution to an uncertain characteristic Cauchy reaction-diffusion problem is studied by Adomian decomposition method. Sufficient conditions are presented for uniform convergence of the propos...

  • Article
  • Open Access
8 Citations
3,206 Views
21 Pages

18 September 2021

The motion control of a surface ship based on a four degrees of freedom (4-DoF) (surge, sway, roll, and yaw) maneuvering motion model is studied in this paper. A time-scale decomposition method is introduced to solve the path-following problem, imple...

(This article belongs to the Special Issue Manoeuvring and Control of Ships and Other Marine Vehicles)
  • Article
  • Open Access
2 Citations
4,181 Views
19 Pages

The Domatic Partition Problem in Separable Graphs

  • Mercedes Landete and
  • José Luis Sainz-Pardo

18 February 2022

The domatic partition problem consists of partitioning a given graph into a maximum number of disjoint dominating sets. This problem is related with the domatic number problem, which consists of quantifying this maximum number of disjoint dominating...

  • Article
  • Open Access
4 Citations
9,433 Views
17 Pages

21 January 2013

The dominating set problem is a core NP-hard problem in combinatorial optimization and graph theory, and has many important applications. Baker [JACM 41,1994] introduces a k-outer planar graph decomposition-based framework for designing polynomial ti...

(This article belongs to the Special Issue Graph Algorithms)
  • Article
  • Open Access
4 Citations
3,401 Views
17 Pages

One of the modern fields in mathematical modelling of water areas is developing hybrid coastal ocean models based on domain decomposition. In coastal ocean modelling a problem to be solved is setting open boundary conditions. One of the methods deali...

(This article belongs to the Special Issue Multiscale, Multiphysics Modelling of Coastal Ocean Processes: Paradigms and Approaches)
  • Article
  • Open Access
9 Citations
2,666 Views
16 Pages

8 November 2024

In this study, we introduced the ψ-Laplace transform Adomian decomposition method, which is a combination of the efficient Adomian decomposition method with the generalization of the classical Laplace transform to treat fractional differential eq...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
1 Citations
2,037 Views
14 Pages

18 October 2023

A D-decomposition of a graph (or digraph) G is a partition of the edge set (or arc set) of G into subsets, where each subset induces a copy of the fixed graph D. Graph decomposition finds motivation in numerous practical applications, particularly in...

(This article belongs to the Special Issue Symmetry and Graph Theory)
  • Article
  • Open Access
2 Citations
3,229 Views
13 Pages

Analysis of the Stochastic Quarter-Five Spot Problem Using Polynomial Chaos

  • Hesham AbdelFattah,
  • Amnah Al-Johani and
  • Mohamed El-Beltagy

24 July 2020

Analysis of fluids in porous media is of great importance in many applications. There are many mathematical models that can be used in the analysis. More realistic models should account for the stochastic variations of the model parameters due to the...

(This article belongs to the Special Issue Fluids in Porous Media)
  • Article
  • Open Access
415 Views
14 Pages

13 September 2026

The Gauss–Newton–Broyden method is proposed and investigated for solving a nonlinear least squares problem with operator decomposition. This method is obtained from the Gauss–Newton method by replacing the Jacobian matrix of a nonli...

(This article belongs to the Special Issue Advances in Nonlinear Dynamics: Theory and Application)
  • Article
  • Open Access
2 Citations
3,953 Views
14 Pages

We consider a general problem of optimal allocation of limited resources in a wireless telecommunication network. The network users are divided into several different groups (or classes), which correspond to different levels of service. The network m...

  • Article
  • Open Access
69 Citations
3,946 Views
25 Pages

A Novel Decomposition-Based Multi-Objective Symbiotic Organism Search Optimization Algorithm

  • Narayanan Ganesh,
  • Rajendran Shankar,
  • Kanak Kalita,
  • Pradeep Jangir and ,
  • Diego Oliva and
  • Marco Pérez-Cisneros
  • + 1 author+ 0 author

17 April 2023

In this research, the effectiveness of a novel optimizer dubbed as decomposition-based multi-objective symbiotic organism search (MOSOS/D) for multi-objective problems was explored. The proposed optimizer was based on the symbiotic organisms’ s...

(This article belongs to the Special Issue Fuzzy Optimization and Decision Making)
  • Article
  • Open Access
742 Views
13 Pages

The λ-Fold Spectrum Problem for the Oriented Pentagons

  • Şafak Durukan-Odabaşı and
  • Uğur Odabaşı

30 October 2025

A D-decomposition of a directed graph G is a collection of arc-disjoint subgraphs of G, each isomorphic to D, such that every arc of G belongs to exactly one subgraph. The λ-fold spectrum problem for a directed graph D asks for the set of all...

(This article belongs to the Special Issue Symmetry and Graph Theory, 2nd Edition)
  • Article
  • Open Access
6 Citations
3,632 Views
21 Pages

On Solving Two-Dimensional Inverse Heat Conduction Problems Using the Multiple Source Meshless Method

  • Cheng-Yu Ku,
  • Jing-En Xiao,
  • Wei-Po Huang,
  • Weichung Yeih and
  • Chih-Yu Liu

28 June 2019

In this article, a newly developed multiple-source meshless method (MSMM) capable of solving inverse heat conduction problems in two dimensions is presented. Evolved from the collocation Trefftz method (CTM), the MSMM approximates the solution by usi...

(This article belongs to the Section Mechanical Engineering)
  • Article
  • Open Access
4 Citations
2,844 Views
15 Pages

7 April 2024

The canonical decomposition of a bipartite graph is a new decomposition method that involves three operators: parallel, series, and K⨁ S. The class of weak-bisplit graphs is the class of totally decomposable graphs with respect to these o...

(This article belongs to the Special Issue Symmetry in Graph Algorithms and Graph Theory III)
  • Article
  • Open Access
13 Citations
3,950 Views
26 Pages

The Multi-Depot Traveling Purchaser Problem with Shared Resources

  • Zahra Sadat Hasanpour Jesri,
  • Kourosh Eshghi,
  • Majid Rafiee and
  • Tom Van Woensel

17 August 2022

Using shared resources has created better opportunities in the field of sustainable logistics and procurement. The Multi-Depot Traveling Purchaser Problem under Shared Resources (MDTPPSR) is a new variant of the Traveling Purchaser Problem (TPP) in s...

(This article belongs to the Topic Sustainable Transport Systems and New Mobility Services: Challenges and Solutions)
  • Article
  • Open Access
2,181 Views
17 Pages

17 April 2024

The study presents a novel approach called FEM-POD, which aims to enhance the computational efficiency of the Finite Element Method (FEM) in solving problems related to non-Fourier heat conduction. The present method employs the Proper Orthogonal Dec...

(This article belongs to the Section High-Energy Beam Surface Engineering and Coatings)
  • Article
  • Open Access
15 Citations
4,863 Views
18 Pages

Asynchronous Iterations of Parareal Algorithm for Option Pricing Models

  • Frédéric Magoulès,
  • Guillaume Gbikpi-Benissan and
  • Qinmeng Zou

21 March 2018

Spatial domain decomposition methods have been largely investigated in the last decades, while time domain decomposition seems to be contrary to intuition and so is not as popular as the former. However, many attractive methods have been proposed, es...

(This article belongs to the Special Issue Chaos and Randomness of Discrete Dynamical Systems: Their Use in Applied Science)
  • Article
  • Open Access
4 Citations
2,407 Views
16 Pages

6 December 2022

The present manuscript examines different forms of Initial-Value Problems (IVPs) featuring various types of Ordinary Differential Equations (ODEs) by proposing a proficient modification to the famous standard Adomian decomposition method (ADM). The p...

  • Article
  • Open Access
18 Citations
5,724 Views
22 Pages

Non-Intrusive Reduced-Order Modeling Based on Parametrized Proper Orthogonal Decomposition

  • Teng Li,
  • Tianyu Pan,
  • Xiangxin Zhou,
  • Kun Zhang and
  • Jianyao Yao

27 December 2023

A new non-intrusive reduced-order modeling method based on space-time parameter decoupling for parametrized time-dependent problems is proposed. This method requires the preparation of a database comprising high-fidelity solutions. The spatial bases...

(This article belongs to the Section J: Thermal Management)
  • Article
  • Open Access
6 Citations
2,835 Views
15 Pages

30 January 2023

Order reduction methods are important tools for systems engineering and can be used, for example, for parameter estimation of kinetic models for systems biology applications. In particular, the Proper Orthogonal Decomposition (POD) method produces a...

(This article belongs to the Special Issue Mathematical Biology: Modeling, Analysis, and Simulations, 2nd Edition)
  • Article
  • Open Access
5 Citations
2,445 Views
19 Pages

18 August 2024

In this paper, we study inverse interface problems with unknown boundary conditions, using point observations for parabolic equations with cylindrical symmetry. In the one-dimensional, two-layer interface problem, the left interval 0<r<l1, i.e....

(This article belongs to the Special Issue Symmetry in Mathematical Theory and Simulation Methods for Backward Problems)
  • Article
  • Open Access
3 Citations
1,900 Views
21 Pages

28 October 2022

This work addresses the robust counterpart of the shortest path problem (RSPP) with a correlated uncertainty set. Because this problem is difficult, a heuristic approach, based on Frank–Wolfe’s algorithm named discrete Frank–Wolfe (...

  • Feature Paper
  • Article
  • Open Access
1 Citations
3,890 Views
23 Pages

17 January 2024

A time stepping quasilinearization approach to the mixed (or coupled) form of one and two dimensional Richards’ equations is developed. For numerical solution of the linear ordinary differential equation (ODE) for 1D case and elliptic for 2D ca...

(This article belongs to the Special Issue Applications of Mathematics to Fluid Dynamics)
  • Article
  • Open Access
4 Citations
3,453 Views
15 Pages

28 November 2021

The aim of this article is to present a procedure for the factorization and exact solution of boundary value problems for a class of n-th order linear Fredholm integro-differential equations with multipoint and integral boundary conditions. We use th...

  • Article
  • Open Access
5 Citations
3,347 Views
13 Pages

A Levenberg-Marquardt Method for Tensor Approximation

  • Jinyao Zhao,
  • Xuejuan Zhang and
  • Jinling Zhao

10 March 2023

This paper presents a tensor approximation algorithm, based on the Levenberg–Marquardt method for the nonlinear least square problem, to decompose large-scale tensors into the sum of the products of vector groups of a given scale, or to obtain...

(This article belongs to the Special Issue Symmetry and Asymmetry in AI-Enabled Human-Centric Collaborative Computing)
  • Article
  • Open Access
405 Views
17 Pages

The electromagnetic scattering problem for dielectric objects involves a linear integral equation that relates the total field to the scattered field inside the object. Numerical solution methods require discretization by choosing a suitable set of b...

of 55