Constructing a Hybrid Recommender System

Journal of Computer and Systems Sciences International - Recommender systems provide recommendations for users. In this paper, we train and test some algorithms for recommender systems on a certain...     

Grid parallelizing of discrete optimization problems with quasi-block structure matrices

We consider discrete optimization problems with Boolean variables and rarefied matrices of large dimensions. In some cases we manage to extract the quasi-block structure of the initial matrices. In particular, in this paper we have problems with the so-called block-stair and block-tree structures. Blocks in such problems have connecting variables with other blocks. We present the parallelization of such large problems on GRID systems, where problems for separate blocks are solved independently of one another, and the initial problems cannot be directly solved due to the unacceptably large time requirements.     

Metric Interpolation for the Problem of Minimizing the Maximum Lateness for a Single Machine

Automation and Remote Control - The paper is based on using methods of continuous mathematics in discrete problems. Three new approaches to solving scheduling theory problems are considered,...     

Decomposition in Multidimensional Boolean-Optimization Problems with Sparse Matrices

In this paper, we review problems associated with sparse matrices. We formulate several theorems on the allocation of a quasi-block structure in a sparse matrix, as well as on the relation of the degree of the quasi-block structure and the number of its blocks, depending on the dimension of the matrix and the number of nonzero elements in it. Algorithms for the solution of integer optimization problems with sparse matrices that have the quasi-block structure are considered. Algorithms for allocating the quasi-block structures are presented. We describe the local elimination algorithm, which is efficient for problems with matrices that have a quasi-block structure. We study the problem of an optimal sequence for the elimination of variables in the local elimination algorithm. For this purpose, we formulate a series of notions and prove the properties of graph structures corresponding to the order of the solution of subproblems. Different orders of the elimination of variables are tested.     

Opening Remarks by the Program Committee of the Conference “Intelligent Data Processing. Theory and Applications” (IDP-2020)

Automation and Remote Control - The special issue presents selected papers of the 13th International Conference “Intelligent Data Processing. Theory and Applications” (IDP-2020), held...     

Metaheuristic Algorithms for Multiagent Routing Problems

Automation and Remote Control - The problems of constructing routes in complex networks by many sales agents are considered. Formalization leads to pseudo-Boolean discrete optimization problems...