Varvara Rasskazova

Varvara Rasskazova
Moscow Aviation Institute · Department of Applied Mathematics


How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more


Publications (11)
The article presents an algorithm for solving the applied problem of assigning and moving locomotives, based on the solution of the graph–theoretic problem of covering the vertices of a directed graph with a set of oriented paths. A detailed example is given for an algorithm for covering the vertices of a directed graph with a set of maximal paths.
Full-text available
The paper is a review of the present-day problem about the logistic optimization of both two-dimensional and three-dimensional warehouses with m cranes. A tuple of heuristic algorithms is proposed to solve the NP-hard problem with minimizing the total execution time of a set of jobs using m cranes. The described optimization approaches are applicab...
The paper proposes an approach to solving multiclass pattern recognition problem in a geometric formulation based on convex hulls and convex separable sets (CS-sets). The advantage of the proposed method is the uniqueness of the resulting solution and the uniqueness of assigning each point of the source space to one of the classes. The approach als...
We consider the problem of assigning a “track procession,” i.e., the time for railway network maintenance, when train movements are forbidden. The railway network is presented in the form of an undirected multigraph. Movements along this multigraph are carried out with a set of conflict-free subslots, where each “subslot” is a five-tuple of the arr...
We consider the problem of decomposing the set of paths in a directed graph and its application to reducing the dimension of an applied problem on the assignment and transportation of locomotives. On a given set of paths and a set of strongly connected subgraphs, we define a special table. To solve the graph decomposition problem, we develop a heur...
The optimization problem of planning the railway freight traffic was presented, and approaches to reduction of problem dimension by constructing a hierarchy of the problems of train traffic planning were described. The notion of conflict graph on a set of energy-efficient standard threads was introduced. A “traveling wave” algorithm to construct th...
Boolean functions are a modelling tool useful in many applications; monotone Boolean functions make up an important class of these functions. For instance, monotone Boolean functions can be used for describing the structure of the feasible subsystems of an infeasible system of constraints, because feasibility is a monotone feature. In this paper we...


Cited By


Project (1)
Frontiers of Engineering Management (FEM) is a research journal supervised by Chinese Academy of Engineering, administered jointly by Tsinghua University, Huazhong University of Science and Technology and Higher Education Press, and published by Higher Education Press. It is a journal designed and organized in inter-national dimensions and published in English in both print and online versions quarterly. It covers Economics of Engineering, Sociology of Engineering, Decision Making of Engineering, etc. More information please see