Call for Papers Invited speakers Committees Important dates Registration fee Submissions Organizers & partners

Abstract and paper submission

The organizers plan to publish the best papers of the conference in the Lecture Notes in Computer Science (Springer) and Communications in Computer and Information Science (CCIS) series.

Authors are invited to submit their papers reporting on novel results that are not published or submitted simultaneously to any journal or another conference with refereed proceedings.

Abstract of the paper is sending by the Easychair Conference Management System, which is available now. Title of the presentation, key words, text of the abstract, and appropriate topics are included in the corresponding fields in the Easychair System.

Papers should be prepared in the Springer LNCS Format according to the LaTeX templates, can have 12-15 pages.

Please, follow the official Springer authors guidelines

All papers should be submitted through the Easychair Conference Management System too.

Authors can send abstract without paper for oral presentation.


The conference proceedings are intended to be published by Springer Nature in the Lecture Notes in Computer Science (LNCS) and Communications in Computer and Information Science (CCIS) series.

Authors of accepted papers will receive an invitation from the EasyChair system and instructions how to upload camera-ready zip.file to the system.


LNCS – May,15

CCIS – June, 1

Accepted papers

Siberian Electronic Mathematical Reports

18 Artem Pyatkin and Ilya Chernykh. On complexity of two-machine routing open shop problem

24 Yulia Zakharova and Alexander Kononov. Minimizing Makespan for Parallelizable Jobs with Energy Constraint

46 Polina Agzyamova and Ilya Chernykh. On the routing open shop on a tree with preemptions allowed

63 Andrei Nikolaev. On 1-skeleton of the polytope of pyramidal tours with step-backs

125 Alexander Kolnogorov. Gaussian One-Armed Bandit with Both Unknown Parameters

130 Dmitry Gribanov and Dmitry Malyshev. A faster algorithm for counting of the integer points in Δ-modular polyhedra

135 Vitaly Strusevich. Minimizing Total Completion Time on Parallel Machines with Unit Length Jobs That Need One Additional Resource

Journal of Applied and Industrial Mathematics

15 Sergey Lavlinskii, Artem Panin and Alexander Plyasunov. Bilevel Models of Economic Policy Formation with Transaction Costs and Insurance of Contracts Breaking Risks

17 Alexey Ratushnyi and Yury Kochetov. A matheuristic for the trailers waiting time minimization with uncertain arrival times

41 Vladimir N. Krutikov, Predrag S. Stanimirovic, Oksana N. Indenko, Elena M. Tovbis and Lev A. Kazakovtsev. Optimization of parameters for rank-two correction of the subgradient method metric matrices

66 Evgeni Nurminski and Natalia Shamray. Large-scale Modeling and Optimization of Production-Level Transportation System

83 Sofia M. Shperling and Yuriy A. Kochetov. A knapsack problem for rectangles under a gravity center constraint

116 Andrey Melnikov and Vladimir Beresnev. Computing an upper bound in the two-stage competitive location model

Lecture Notes and Computer Science

5 Igor Konnov. Primal-Dual Method for Optimization Problems with Changing Constraints

9 Igor Vasilyev, Dmitry Rybin, Sergei Kudria, Ren Jie and Dong Zhang. Multiple project scheduling for a network roll-out problem: MIP formulation and heuristic

21 Tatiana V. Gruzdeva and Anton V. Ushakov. On a Nonconvex Distance-Based Clustering Problem

40 Valeriy Marakulin. On the existence of a fuzzy core in an exchange economy

47 Alla Albu and Vladimir Zubov. On solving one spectral problem

53 Anna N. Rettieva. Multicriteria Dynamic Games with Asymmetric Horizons

55 Leon Petrosyan and Yaroslavna Pankratova. Two Level Cooperation in Dynamic Network Games with Partner Sets

59 Elena Konovalchikova and Anna Ivashko. Optimal Pricing in Two-Sided Markets on the Plain with Different Agent Types

61 Marina Danilova. On the Convergence Analysis of Aggregated Heavy-Ball Method

71 Julia Chirkova and Vladimir Mazalov. Optimal arrivals to preemptive queue system

78 Sergey Ivanov and Aleksandra Mamchur. Multistage inventory model with probabilistic and quantile criteria

79 Alexander Fominyh. Application of the Subdifferential Descent Method to a Classical Nonsmooth Variational Problem

80 Angelina Chebotareva, Shimai Su, Elizaveta Voronina and Ekaterina Gromova. Value of cooperation in a differential game of pollution control

91 Anna Tur and Leon Petrosyan. The core of cooperative differential games on networks.

113 Demyan Yarmoshik, Alexander Rogozin, Oleg. O. Khamisov, Alexander Gasnikov and Pavel Dvurechensky. Decentralized convex optimization under affine constraints for power systems control

115 Darina Dvinskikh, Vladislav Tominin, Iaroslav Tominin and Alexander Gasnikov. Zeroth-Order Optimization for Non-Smooth Saddle Point Problems with Maximum Admissible Noise

145 Nena Mladenovic, Raca Todosijevic and Dragan Urosevic. Dispersion problem under capacity and cost constraints: multiple neighborhood tabu search

146 PetarĆirković, Predrag Đorđević, Miloš Milićević and Tatjana Davidović. Metaheuristic Approach to Spectral Reconstruction of Graphs

148 Luka Matijević. Variable Neighborhood Search for Multi-label Feature Selection

150 Nadezhda V. Smirnova and Denis Kuzyutin. A novel payoff distribution procedure for sustainable cooperation in an extensive game with payoffs at all nodes

151 Denis Kuzyutin, Julia V. Skorodumova and Nadezhda V. Smirnova. A cooperation scheme in multistage game of renewable resource extraction with asymmetric players

Communications in Computer and Information Science

3 Rashid Yarullin, Igor Zabotin and Oksana Shulgina. Procedures for Updating Immersion Sets in the Cutting Method and Estimating the Solution Accuracy

10 Rashid Yarullin and Igor Zabotin. One relaxed variant of the proximal level method

14 Marina Danilova and Eduard Gorbunov. Distributed Methods with Absolute Compression and Error Compensation

22 Alexander Zyryanov, Yury Kochetov and Sergey Lavlinski. The gap between cooperative and non-cooperative solutions for the public-private partnership model

25 Nikita Gorbunov, Victor Il'Ev and Svetlana Il'Eva. An approximation algorithm for graph clustering with clusters of bounded sizes

30 EvgenyBobrov, Alexander Markov, Sviatoslav Panchenko and Dmitry Vetrov. Variational Autoencoders for Precoding Matrices with High Spectral Efficiency

44 Natalia Grigoreva. Approximation non-list scheduling Algorithms for Multiprocessors System

48 Anastasia Tomilova. An optimization approach to the robust control law design for a magnetic levitation system

51 Margarita Sotnikova and Ruslan Sevostyanov. Optimal control of output variables within a given range based on a predictive model

52 Arseniy Spiridonov and Sergey Kumkov. Cascade Merge of Aircraft Flows as Mixed Integer Linear Programming Problem

58 Alexander I. Smirnov and Vladimir D. Mazurov. Conditions for the fixed points existence of locally indecomposable subhomogeneous maps

60 Vladimir Khandeev and Sergey Neshchadim. Approximate algorithms for some maximin clustering problems

65 Kamil Aida-Zade and Vugar Hashimov. Synthesis of motion control of rod heating sources with optimization of measurement points of the process state

76 Alexander Vasin and Olesya Grigoryeva. Optimal strategies of consumers with energy storages in electricity market.

85 Sergey Semenov and Nikolai Zolotykh. An Experimental Analysis of Dynamic Double Description Method Variations

87 Artem Panin and Alexander Plyasunov. Competitive location strategies in the (r|p)-centroid problem on a plane with linear barriers

92 Pavel Borisovsky and Evgenia Fedotova. Genetic algorithm for the variable-sized vector bin-packing problem with limited number of bins

105 German Mityai, Stepan Kabanov, Haitao Wu and OvanesPetrosyan. Comparison of Reinforcement Learning based Control Algorithms for Autonomous Driving Problem

114 Nikolay Korgin, Vsevolod Korepanov and Anna Blokhina. Stability of Persons' Pareto Behavior with respect to Different Mechanisms in Resource Allocation Game Experiments

126 Mikhail Krechetov, Mikhail Kharitonov and Dmitri Shmelkin. Spectrum Allocation in Optical Networks: DSatur Coloring and Upper Bounds

140 Natalia Nikitina and Vladimir Mazalov. Network centralities based on non-additive measures

144 Tatjana Jakšić Krüger, Tatjana Davidović and Vladisav Jelisavčić. Parameter analysis of variable neighborhood search applied to multiprocessor scheduling with communication delays