Digital transformation is taking over more and areas of everyday life. Business digitalization has already become something than just the introduction modern equipment, first all, it enterprise management system. Companies are increasingly rethinking their development strategies to focus on personalizing offers increasing customer loyalty. Currently, there a fairly large number software tools f...

In this paper we formulate a two-stage stochastic quadratic optimization problem, that models a production planning problem of multiple products, over several time periods, with uncertain demands. This model considers quadratic inventory holding and demand backlogging recourse costs, which model the saturation phenomenon inherent to the increase of the inventory and/or backlogged demand levels....

The inverse kinematics problems of redundant manipulators have been investigated for many years. The conventional method of solving this problem analytically is by applying the Jacobian Pseudoinverse Algorithm. It is effective and able to resolve the redundancy for additional constraints. However, its demand for computational effort makes it not suitable for real-time control. Recently, neural ...

In the current competitive, integrated approach to supply chain management and distribution network design, especially in conditions of uncertainty, in order to ensure timely needs of customers in terms of savings in costs and raise the level of customer service, in recent years. Estimating the stochastic demand for transportation distribution networks is a crucial factor in transport planning ...

In this paper, we propose a technique for determining a source term in an inverse heat conduction problem (IHCP) using Radial Basis Functions (RBFs). Because of being very suitable instruments, the RBFs have been applied for solving Partial Dierential Equations (PDEs) by some researchers. In the current study, a stable meshless method will be pro- posed for solving an (I...

The Boolean Satisfiability Problem (SAT) belongs to the class of NP-complete problems, meaning that there is no known deterministic algorithm that can solve an arbitrary problem instance in less than exponential time (parametrized on the length of the input). There is great industrial demand for solving SAT, motivating the need for algorithms which perform well. I present a comparison of two ap...