1. <em id="xz0sq"></em>


      (MOTOR 2019)

      JULY 8–12, 2019, EKATERINBURG
      © alshevskix.livejournal.com

      THE NEWS

      November 14, 2019
      CCIS volume of the conference proceedings is out of print. Free access to the full texts of all full papers is open until December 10, 2019.

      October 28, 2019
      New deadlines for special issues:
      January 10, 2020 Journal of Global Optimization,
      January 19, 2020 Optimization Methods & Software (OMS),
      January 15, 2020 Yugoslav Journal of Operations Research.

      July 11, 2019

      June 23, 2019
      Technical program has been updated.

      June 14, 2019
      Technical program draft and tentative timetable are published.

      June 12, 2019
      LNCS volume of the conference proceedings is out of print.


      International conference “Mathematical Optimization Theory and Operations Research” (MOTOR2019) http://www.hnhrw.cn will be held on July 8-12, 2019, in a picturesque place near Ekaterinburg, Russia, at the borderline between Europe and Asia.

      The conference brings together a wide research community in the fields of mathematical programming and global optimization, discrete optimization, complexity theory and combinatorial algorithms, optimal control and games, and their applications in relevant practical problems of operations research, mathematical economy, and data analysis.

      Important dates

      Abstract submission due:
      January 15, 2019
      February 1, 2019
      Full paper submission due:
      February 1, 2019
      February 15, 2019
      Notification of acceptance:
      March 15, 2019
      March 27, 2019
      Camera ready version:
      April 7, 2019
      June 30, 2019
      Conference dates:
      July 8-12, 2019

      Previous events

      MOTOR2019 is a descendant of a number of well-known International and All-Russian conferences, which were held in Ural, Siberia, and the Far East for a long time:

      Conference name
      # in series
      Last event

      Baikal International Triennial School Seminar on Methods of Optimization and Their Applications, BITSS MOPT



      Mathematical Programming and Applications, MPA



      Discrete Optimization and Operations Research, DOOR



      Optimization Problems and their Applications, OPTA




      • mathematical programming
      • global optimization
      • integer programming and combinatorial optimization
      • computational complexity, approximation algorithms, schemes, bounds, heuristics and metaheuristics
      • optimal control and game theory
      • optimization and approximation
      • optimization in machine learning and data analysis
      • applications in operations research: scheduling, routing, facility location, packing and cutting, manufacturing systems, etc.


      Program Committee Chairs

      Prof.   Michael Khachay
      Krasovsky Inst. of Math. and Mech., Russia
      Prof.   Yury Kochetov
      Sobolev Inst. of Math., Russia
      Prof.   Panos M. Pardalos
      University of Florida, USA

      Program Committee

      (to be extended)

      Prof. A. Afanasiev
      IITP RAS, Russia
      Prof. E. Amirgaliev
      Suleyman Demirel University, Kazakhstan
      Prof. A. Antipin
      Dorodnicyn Computing Centre FRC CSC RAS, Russia
      Prof. A. Bagirov
      Federation University Australia, Australia
      Prof. E. Bampis
      Sorbonne Université, France
      Prof. O. Battaia
      ISAE-Supaero, Toulouse, France
      Acad. V.I. Berdyshev
      Krasovsky Institute of Mathematics and Mechanics, Russia
      Prof. V. Beresnev
      Sobolev Institute of Mathematics, Russia
      Dr. R. van Bevern
      Novosibirsk State University, Russia
      Prof. O. Burdakov
      Link?ping University, Sweden
      Prof. S. Butenko
      Texas A&M University, USA
      Prof. I. Bykadorov
      Sobolev Institute of Mathematics, Russia
      Prof. T. Davidovic
      Mathematical Institute SANU, Serbia
      Prof. V. Deineko
      Warwick University, GB
      Prof. S. Dempe
      Freiberg University, Germany
      Prof. A. Dolgui
      IMT Atlantique, France
      Prof. A. Eremeev
      Dostoevsky Omsk State University, Russia
      Acad. Y.G. Evtushenko
      Dorodnicyn Computing Centre FRC CSC RAS, Russia
      Prof. A. Erzin
      Sobolev Institute of Mathematics, Russia
      Prof. F. Fomin
      University of Bergen, Norway
      Prof. E. Gimadi
      Sobolev Institute of Mathematics, Russia
      Prof. A. Gornov
      Matrosov Institute for System Dynamics and Control Theory SB RAS, Russia
      Prof. A. Grigoriev
      Maastricht University, Netherlands
      Prof. M. Gusev
      Krasovsky Institute of Mathematics and Mechanics, Russia
      Prof. M. Jacimovic
      University of Montenegro, Montenegro
      Prof. V. Kalashnikov
      ITESM, Campus Monterrey, Mexico
      Prof. V. Kalyagin
      Higher School of Economics, Russia
      Prof. A. Kazakov
      Matrosov Institute for System Dynamics and Control Theory SB RAS, Russia
      Prof. A. Kel'manov
      Sobolev Institute of Mathematics, Russia
      Prof. O. Khamisov
      Melentiev Energy Systems Institute SB RAS, Russia
      Prof. A. Kibzun
      Moscow Aviation Institute, Russia
      Prof. D. (David) Kim
      Kennesaw State University, USA
      Prof. I. Konnov
      Kazan Federal University, Russia
      Prof. A. Kononov
      Sobolev Institute of Mathematics, Russia
      Prof. V. Kotov
      Belarusian State University, Belarus
      Prof. I. Kotsireas
      University of Waterloo, Canada
      Prof. M.Y. Kovalyov
      United Institute of Informatics Problems NASB, Belarus
      Prof. A. Lazarev
      Trapeznikov Institute of Control Sciences RAS, Russia
      Prof. V. Levit
      Ariel University, Israel
      Prof. B. M.T. Lin
      National Chiao Tung University, Hsinchu, Taiwan
      Prof. N. Lukoyanov
      Krasovsky Institute of Mathematics and Mechanics, Russia
      Prof. V. Mazalov
      Institute of Applied Mathematical Research of KRC RAS, Russia
      Prof. N. Mladenovic
      Emirates College of Technologies, Abu Dhabi, UAE
      Prof. Y. Nikulin
      University of Turku, Finland
      Prof. E. Nurminski
      Far Eastern Federal University, Russia
      Prof. L. Petrosyan
      Saint-Petersburg University, Russia
      Prof. A. Petunin
      Ural Federal University, Russia
      Prof. B.T. Polyak
      Trapeznikov Institute of Control Science, Russia
      Prof. L. Popov
      Krasovsky Institute of Mathematics and Mechanics, Russia
      Prof. M. Posypkin
      Dorodnicyn Computing Centre, FRC CSC RAS, Russia
      Prof. O. Prokopyev
      University of Pittsburgh, USA
      Prof. A. Pyatkin
      Sobolev Institute of Mathematics, Russia
      Prof. S. Raha
      Indian Institute of Science, India
      Acad. K.V. Rudakov
      Dorodnicyn Computing Centre FRC CSC RAS, Russia
      Prof. K. Sabo
      University of Osijek, Croatia
      Prof. L. Sakalauskas
      Univeristy of Vilnius, Lithuania
      Prof. E. Semenkin
      Reshetnev Siberian State University of Science and Technology, Russia
      Prof. Y. Sergeev
      University of Calabria, Italy
      Prof. N. Shakhlevich
      University of Leeds, GB
      Prof. A. Shananin
      Moscow Institute of Physics and Technology, Russia
      Prof. A. Sifaleras
      University of Macedonia, Greece
      Prof. V. Skarin
      Krasovsky Institute of Mathematics and Mechanics, Russia
      Prof. A. Strekalovsky
      Matrosov Institute for System Dynamics and Control Theory SB RAS, Russia
      Prof. V. Strusevich
      University of Greenwich, GB
      Prof. T. Tchemisova
      University of Aveiro, Portugal
      Prof. V. Ukhobotov
      Chelyabinsk State University, Russia
      Prof. V.N. Ushakov
      Krasovsky Institute of Mathematics and Mechanics, Russia
      Prof. V.V. Vasin
      Krasovsky Institute of Mathematics and Mechanics, Russia

      Industry session chairs

      Prof. D. Gainanov
      Ural Federal University, Russia
      Dr.  A. Kurochkin
      Sobolev Institute of Mathematics, Russia

      Organizing Committee

      Prof. M.Y. Khachay (co‑chair)
      Krasovsky Inst. of Math. and Mech., Russia
      Dr.  K. Kobylkin (co‑chair)
      Krasovsky Inst. of Math. and Mech., Russia
      A. Borbunov
      Krasovsky Inst. of Math. and Mech., Russia
      Dr.  N.A. Kochetova
      Sobolev Institute of Mathematics, Russia
      Dr.  P.A. Kononova
      Sobolev Institute of Mathematics, Russia
      Dr.  F. Kornilov
      Krasovsky Inst. of Math. and Mech., Russia
      G.F. Kornilova
      Krasovsky Inst. of Math. and Mech., Russia
      M.A. Kostina
      Krasovsky Inst. of Math. and Mech., Russia
      Dr.  V.B. Kostousov
      Krasovsky Inst. of Math. and Mech., Russia
      Dr.  T. Medvedev
      Higher School of Economics, Russia
      Dr.  K. Neznakhina
      Krasovsky Inst. of Math. and Mech., Russia
      Y. Ogorodnikov
      Krasovsky Inst. of Math. and Mech., Russia
      M. Pasynkov
      Krasovsky Inst. of Math. and Mech., Russia
      Dr.  M. Poberiy
      Krasovsky Inst. of Math. and Mech., Russia
      Dr.  A.I. Smirnov
      Krasovsky Inst. of Math. and Mech., Russia


      Plenary lectures


      Prof. Olga Battaia

      ISAE-Supaero, Toulouse

      Decision under ignorance: a comparison of existing criteria in a context of linear programming

      Abstract: Decision or optimization problems often arise in an uncertain context. Depending on available information, several approaches have been proposed to model this uncertainty. In this talk, we focus on the case of low knowledge on possible states, namely decision under ignorance. In this case the decision-maker is able to give the set of possible values of optimization problem parameters but she/he is not able to differentiate them. We compare a set of criteria that can be used in this case on the example of a linear programming problem and discuss some possible applications.


      Prof. Oleg Burdakov

      Linkoping University

      Node partitioning and cycles creation problem

      Abstract: We present a new class of network optimization problems, which extend the classical NP-hard travelling salesman problem. It is formulated as follows. Given a graph with a certain time associated with each node and each arc, a feasible partition of the nodes in subsets is such that, for each subset, there exists a Hamiltonian cycle whose travelling time is below the time associated with each node in the tour. It is required to find a feasible partitioning which minimizes the number of such cycles. Problems of this kind are typical in numerous applications, where services are repeatedly provided for a set of customers. For each customer, there is a critical time within which a service must be repeated. Given the travelling time between the customers, the set of customers is partitioned so that each subset is served by one agent in a cyclic manner without violating any individual critical time requirement. The number of agents is minimized. As an example, we consider a problem, in which a fleet of unmanned aerial vehicles is used for area patrolling. We introduce an mixed integer programming formulation of the node partitioning and cycles creation problem, and also heuristic algorithms for solving this problem. Results of numerical experiments are presented.

      Joint work with: Kai Hoppmann, Thorsten Koch and Gioni Mexi (ZIB, Berlin, Germany)


      Prof. Christoph Dürr

      Sorbonne Université

      Bijective analysis of online algorithms

      Abstract: In the online computing framework the instance arrives in form a request sequence, every request must be served immediately, through a decision, which generates some cost. Think at the paging problem for memory caches. The goal in this research area is to identify the best strategy, also called online algorithm. Classically this is done through the competitive analysis, i.e. the performance of an online algorithm is compared with the optimal offline solution. The goal is to find an algorithm which minimizes this ratio over the worst case instance. You would say that algorithm A is better than algorithm B if it has a smaller ratio. However there are situations where two algorithms have the same ratio, still in practice one is better than the other. So people came up with a different technique to compare online algorithms directly with each other, rather than through the optimal offline solution. The bijective analysis is one of them. I would do a survey on this technique, and talk about a related personal work: Best-of-two-worlds analysis of online search, with Spyros Angelopoulos and Shendan Jin.


      Prof. Alexander Grigoriev

      Maastricht University

      A survey on possible and impossible attempts to solve the treewidth problem via ILPs

      Abstract: We survey a number of integer programming formulations for the pathwidth and for the treewidth problems. The attempts to find good formulations for the problems span the period of 15 years, yet without any true success. Nevertheless, some formulations provide potentially useful frameworks for attacking these notorious problems. Some others are just curious and interesting fruits of mathematical imagination.


      Prof. Mikhail Kovalyov

      United Institute of Informatics Problems NASB

      No-idle scheduling of unit-time jobs with release dates and deadlines on parallel machines

      Abstract: While the problem of scheduling unit-time jobs with release dates and deadlines on parallel machines is polynomially solvable via a reduction to the assignment problem, the no-idle requirement destroys this reduction and makes the problem challenging. In the presentation, a number of properties of this problem are reported, and heuristic and optimal algorithms based on these properties are described.


      Prof. Vadim Levit

      Ariel University

      Critical and Maximum Independent Sets Revisited

      Abstract: A set of vertices of a graph is independent if no two its vertices are adjacent. A set is critical if the difference between its size and the size of its neighborhood is maximum. Critical independent sets define an important area of research due to their close relationships with the well-known NP-hard problem of finding a maximum independent set. Actually, every critical independent set is contained in a maximum independent set, while a maximum critical independent set can be found in polynomial time. If S is an independent set such that there is a matching from its neighborhood into S, then it is a crown. It is known that every critical independent set forms a crown. A graph is K?nig-Egerváry if every maximum independent set is a crown. Crowns are also accepted as important tools for fixed parameter tractable problems. For instance, the size of the vertex cover can be substantially reduced by deleting both the vertices of a crown and its neighborhood. In this presentation, we discuss various connections between unions and intersections of maximum (critical) independent sets of graphs, which lead to deeper understanding of crown structures, in general, and K?nig-Egerváry graphs, in particular.


      Prof. Bertrand M.T. Lin

      National Chiao Tung University, Hsinchu

      An Overview of the Relocation Problem

      Abstract: The relocation problem is formulated from a municipal redevelopment project in east Boston. In its abstract form, the relocation problem incorporates a generalized resource constraint in which the amount of the resource returned by a completed activity is not necessarily the same as that the activity has acquired for commencing the processing. We will first introduce the connection of the relocation problem to flow shop scheduling. Several traditional scheduling models with the generalized resource constraints have been proposed investigated. We will review existing results, suggest new models and present several open questions.


      Prof. Natalia Shakhlevich

      University of Leeds
      United Kingdom

      On a New Approach for Optimization under Uncertainty

      Abstract: Research on decision making under uncertainty has a long history of study. Still theoretical findings have strong limitations: stochastic programming requires probability distributions for uncertain parameters which are often hard to specify; robust optimisation essentially relies on worst-case scenarios which can be over-pessimistic and far from realistic scenarios; stability analysis explores optimal solutions which can be hard to find even for well predicted scenarios. As an alternative approach, we propose a new system model based on the concept of resiliency. Resilient solutions are not required to be optimal, but they should keep quality guarantees for the widest range of uncertain problem parameters. The talk illustrates key steps of resiliency analysis considering examples of 0/1 combinatorial optimisation problems.


      Prof. Angelo Sifaleras

      University of Macedonia

      Exterior Point Simplex-type Algorithms for Linear and Network Optimization Problems

      Abstract: Two decades of research led to the development of a number of efficient algorithms that can be classified as exterior point simplex-type. This type of algorithms can cross over the infeasible region of the primal (dual) problem and find an optimal solution reducing the number of iterations needed. Thus, such approaches aim to find an efficient way to get to an optimal basis via a series of infeasible ones. In this lecture, we present the developments in exterior point simplex-type algorithms for linear and network optimization problems, over the recent years. We also present other approaches that, in a similar way, do not preserve primal or dual feasibility at each iteration such as the monotonic build-up Simplex algorithms and the criss-cross methods, and also discuss some open research problems.


      Prof. Vitaly Strusevich

      University of Greenwich
      United Kingdom

      Design of Fully Polynomial Time Approximation Schemes for Non-linear Boolean Programming Problems

      Abstract: The talk is aimed at describing various techniques used for designing fully-polynomial approximation schemes (FPTAS) for problems of minimizing and maximizing non-linear non-separable functions of Boolean variables, either with no additional constraints or with linear knapsack constraints. Most of the reported results are on optimizing a special quadratic function known as the half-product, which has numerous scheduling applications. Besides, problems with a more general objective and nested linear constraints are considered and a design of an FPTAS based on the K-approximation calculus is discussed.



      Prof. Tatjana Davidovi?

      Mathematical Institute of the Serbian Academy of Sciences and Arts

      Distributed memory based parallelization of metaheuristic methods

      Abstract: Metaheuristics represent powerful tools for addressing hard combinatorial optimization problems. However, real life instances usually cannot be treated efficiently by the means of computing times. Moreover, a major issue in metaheuristic design and calibration is to provide high performance solutions for a variety of problems. Parallel metaheuristics aim to address both issues. The main goal of parallelization is to speed up the computations by dividing the total amount of work between several processors. Parallelization of stochastic algorithms, such as metaheuristics may involve several additional goals. Besides speeding up the search (i.e., reducing the search time), it could be possible to: improve the quality of the obtained solutions (by enabling searching through different parts of the solution space); improve the robustness of the search (in terms of solving different optimization problems and different instances of a given problem in an effective manner; robustness may also be measured in terms of the sensitivity of the metaheuristic to its parameters); and solve large-scale problems (i.e., solve very large instances that cannot be even stored in the memory of a sequential machine). A combination of gains may also be obtained: parallel execution can enable an efficient search through different regions of the solution space, yielding an improvement of the quality of the final solution within a smaller amount of execution time. The objective of this talk is to present a state-of-the-art survey of the main ideas and strategies related to the parallelization of metaheuristic methods. Various paradigms related to the development of parallel metaheuristics are explained. Among them, communications, synchronization, and control aspects are identified as the most relevant. Implementation issues are also discussed, pointing out the characteristics of shared and distributed memory multiprocessors as target architectures. All these topics are illustrated by the examples from recent literature related to the parallelization of various meta-heuristic methods, with the focus on distributed memory parallelization of Variable Neighborhood Search (VNS) and Bee Colony Optimization (BCO) using Message Passing Interface (MPI) communication protocol.


      Prof. Stephan Dempe

      TU Bergakademie Freiberg

      Bilevel optimization: The Model and its Transformations

      Abstract: Bilevel (or hierarchical) optimization problems aim to minimize one function subject to (a subset of) the graph of the solution set mapping of a second, parameter dependent optimization problem. The parameter is the decision variable of the socalled leader, the optimization problem describing the constraints is the problem of the follower. These problems have a large number of applications in science, engineering, economics. To investigate and solve them, they need to be transformed into a single-level optimization problem. For that different approaches can be used.
        1) If the follower’s problem is regular and convex, it can be replaced using the Karush-Kuhn-Tucker conditions. The result is a so-called Mathematical Program with Equilibrium Constraints. In these nonconvex optimization problems, the Mangasarian-Fromovitz constraint qualification is violated at every feasible point. Solution algorithms converge (under suitable assumptions) to stationary points which are, in general, not related to stationary points of the bilevel optimization problem. To overcome this unpleasant situation, a certain regularization approach can be used. Another approach uses the transformation to a mixed integer (nonlinear) optimization problem.
        2) If the optimal value function of the follower’s problem is used, a nonconvex, nonsmooth optimization problem arises. Again, the (now nonsmooth) Mangasarian-Fromovitz constraint qualification is violated at every feasible point. If the optimal value function is convex or concave, its approximation is helpful to describe a solution algorithm. Optimality conditions can be derived using partial calmness or a certain penalization approach.
        3) The problem can be reformulated as a generalized Nash equilibrium problem.
      Topic of the lecture is the introduction of the model together with some surprising properties and a short overview over promising accesses to investigate and solve it.


      Prof. Oleg Khamisov

      Melentiev Energy Systems Institute SB RAS

      The fundamental role of concave programming in continuous global optimization

      Abstract: A comprehansive description of connections between concave programming and other branches of global optimization like Lipschitz optimization, d.c. optimization etc. is given. It is shown that in general solution of almost every global optimization problem can reduced to solution of a sequence of concave programming problems. Modern concave optimization technology including cuts, branch and bounds, branch and cuts and so on as well as the corresponding extensions to different global optimization problems are presented. A part of the talk is devoted to the connection between concave and mixed 0-1 linear programming.


      Prof. Alexander Kononov

      Sobolev Institute of Mathematics

      Primal-dual Method and Online Problems

      Abstract: The primal-dual method is a powerful tool in the design of approximate algorithms for combinatorial optimization problems. In our tutorial we discuss how this method can be extended to develop online algorithms. The tutorial is based on the survey by N. Buchbinder and J. Naor and the web-presentation by N. Bansal.


      Prof. Nenad Mladenovic

      Emirates College of Technologies
      Abu Dhabi, UAE

      Solving nonlinear system of equations as an optimization problem

      Abstract: The Nonlinear System of Equations (NSE) problem is usually transformed into an equivalent optimization problem, with an objective function that allows us to find all the zeros. Instead of the usual sum-of-squares objective function, the new objective function is presented as the sum of absolute values. Theoretical investigation confirms that the new objective function provides more accurate solutions regardless of the optimization method used. In addition, we achieve increased precision at the expense of reduced smoothness. In this paper, we propose the continuous variable neighbor-hood search method for finding all the solutions to a NSEs. Computational analysis of standard test instances shows that the proposed method is more precise and much faster than two recently developed methods. Similar conclusions are drawn by comparing the proposed method with many other methods in the literature.

      Joint work with: Jun Pei, Zorica Drazic, Milan Drazic, Panos M. Pardalos


      Prof. Evgeni A. Nurminski

      Far Eastern Federal University

      Projection Problems and Problems with Projection

      Abstract: This lecture reviews the state of the art for probably the most common computational operation in applied mathematics --- projection, which can be also considered as the problem of finding the least norm element (LNE) in a given subset of a linear vector space. The special attention in the lecture will be given to Euclidean or orthogonal projection, but we plan to discuss another norms as well. Projection is computationally intensive operation even for relatively simple sets like canonical simplexes and special algorithms are a way more efficient than off-the-shelf quadratic programming methods especially for large-scale problems. Large-scale projection problems can be decomposed in different sequential or parallel manner as extension of celebrated Kaczmarz sequential projection procedure and block-row action methods. We discuss also the problem of numerical instability of projection operation which is quite common in such applications as new optimization algorithms, linear programming, machine learning and automatic classification.


      Prof. Alexander Strekalovsky

      Matrosov Institute for System Dynamics and Control Theory SB RAS

      Modern methods of nonconvex optimization

      Abstract: We address the nonconvex optimization problem with the cost function and equality and inequality constraints given by d.c. functions. The linear space of d.c. functions possesses a number of very attractive properties. For example, every continuous function can be approximated at any desirable accuracy by a d.c. function and any twice differentiable function belongs to the DC space. In addition, any lower semicontinuous (l.s.c.) function can be approximated at any precision by a sequence of continuous functions. Furthermore, provided that for the optimization problem under study we proposed the new Global Optimality Conditions (GOCs), which have been published in the English and Russian languages. The natural question arises: is it possible to construct a computational scheme based on the GOCs (otherwise, what are they for?) that would allow us not only to generate critical points (like the KKT-vectors) but to escape any local pitfall, which makes it possible to reach a global solution to the problem in question? First of all, we recall that with the help of the Theory of Exact Penalization, the original d.c. problem was reduced to a problem without constraints. Moreover, it can be readily seen that this penalized problem is a d.c. problem as well. Furthermore, special Local Search Methods (LSMs) were developed and substantiated in view of their convergence features. In addition, the GOCs were generalized for the minimizing sequences in the penalized problem. A special theoretical method was proposed and its convergence properties were studied. We developed a Global Search Scheme (GSS) based on all theoretical results presented above, and, moreover, we were lucky to prove that the sequence produced by the GSS turned out to be minimizing in the original d.c. optimization problem. Finally, we developed a Global Search Method (GSM), combining the special LSM and the GSS proposed. The convergence of the GSM is also investigated under some natural assumptions. The first results of numerical testing of the approach will be demonstrated.


      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. Papers should be prepared in the Springer LNCS Format, can have 12-15 pages, and submitted in PDF. Please, follow the official Springer authors guidelines and LNCS Latex templates. All papers should be submitted through the easychair conference management system, which is available now.


      Book of Abstracts


      Conference proceedings will be published by Springer Nature as volumes of Lecture Notes in Computer Science (LNCS) and Communications in Computer and Information Science (CCIS) series.

      Lecture Notes in Computer Science

      LNCS vol. 11548

      Accepted papers

      Ilya Chernykh and Ekaterina Lgotina
      How the difference in travel time affects the optima localization for the routing open shop
      Igor' Izmest'Ev and Viktor Ukhobotov
      On a single-type differential game with a non-convex terminal set
      René Van Bevern, Till Fluschnik and Oxana Tsidulko
      On (1+ε)-approximate data reduction for the Rural Postman Problem
      Artem Pyatkin and Mikhail Golovachev
      Routing Open Shop with two nodes, unit processing times and equal number of jobs and machines
      Maximilian John and Andreas Karrenbauer
      Dynamic Sparsification for Quadratic Assignment Problems
      Andrei Orlov and Tatiana Gruzdeva
      The Local and Global Searches in Bilevel Problems with a Matrix Game at the Lower Level
      Michael Khachay and Yuri Ogorodnikov
      Approximation scheme for the Capacitated Vehicle Routing Problem with Time Windows and non-uniform demand
      Sergey Lavlinskii, Artem Panin and Alexander Plyasunov
      Stackelberg Model and Public–Private Partnerships in the Natural Resources Sector of Russia
      Konstantin Kobylkin and Irina Dryakhlova
      Approximation algorithms for piercing special families of hippodromes: an extended abstract
      Sergey Khapugin and Andrey Melnikov
      Local Search Approach for the Medianoid Problem with Multi-purpose Shopping Trips
      Andrei Nikolaev
      On vertex adjacencies in the polytope of pyramidal tours with step-backs
      Igor Konnov and Olga Pinyagina
      Splitting method with adaptive step-size
      Anna Kozlova and Andrei Nikolaev
      Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope
      Stephan Dempe
      Computing local optimal solutions of the bilevel optimization problem using the KKT approach
      Anna N. Rettieva
      Coalition Stability in Dynamic Multicriteria Games
      Victor Il'Ev, Svetlana Il'Eva and Alexander Morshinin
      A 2-approximation algorithm for the graph 2-clustering problem
      Valeriy Marakulin
      Spatial equilibrium in a multidimensional space: an immigration-consistent division into countries centered at barycenter
      Christof Defryn, Julian Golak, Alexander Grigoriev and Veerle Timmermans
      Inland waterway efficiency through skipper collaboration and joint speed optimization
      Sergey Ivanov and Irina Zhenevskaya
      Estimation of the necessary sample size for approximation of stochastic optimization problems with probabilistic criteri
      Dimitrije D. ?voki?, Yury Kochetov, Alexander Plyasunov and Aleksandar Savi?
      The competitive hub location under the price war
      Mikhail Gusev
      Estimates of the minimal eigenvalue of the controllability Gramian for a system containing a small parameter
      Vitalii Arestov
      Best approximation of a differentiation operator on the set of smooth functions with exactly or approximately given Fourier transform
      Oxana Matviychuk
      On ellipsoidal estimates for reachable sets of the control system
      Ekaterina Kolpakova
      Open-loop Strategies in Nonzero-sum Differential Game with Multilevel Hierarchy
      Vitaly Zhadan
      Variant of Simplex Method for Second-order Cone Programming
      Anton Eremeev, Alexander Kelmanov, Mikhail Y. Kovalyov and Artem Pyatkin
      Maximum Diversity Problem with Squared Euclidean Distance
      Maria Barkova
      On generating nonconvex optimization test problems
      Leon Petrosyan and Yaroslavna B. Pankratova
      Equilibrium and Cooperation in the Repeated Hierarchical Games
      Dragan Urosevic, Yiad Ibrahim Yousef Alghoul, Zhazira Amirgaliyeva and Nenad Mladenovic
      Less is more: Tabu search for Quadratic Bipartite Programming Problem
      Boris Ananyev
      Control Problem of Parabolic System with Incomplete Information
      Marina Plekhanova
      Problems of hard control for a class of degenerate fractional order evolution equations
      Ildus Kuchkarov and Ovanes Petrosian
      On a Class of Linear Quadratic Non-cooperative Differential Games with Continuous Updating
      Anton Eremeev, Nikolay Tyunin and Alexander Yurkov
      Non-Convex Quadratic Programming Problems in Short Wave Antenna Array Optimization
      Vladislav Sovrasov
      Comparison of several stochastic and deterministic derivative-free global optimization algorithms
      Fedor Stonyakin, Darina Dvinskikh, Pavel Dvurechensky, Alexey Kroshnin, Olesya Kuznetsova, Artem Agafonov, Alexander Gasnikov, Alexander Turin, Cesar Uribe, Dmitry Pasechnyuk and Sergei Artamonov
      Gradient Method for Problems with Inexact Model of the Objective
      Vladimir Mazalov and Elena Parilina
      Game of competition for opinion with two centers of influence
      Sergey Semenov and Nikolai Zolotykh
      A dynamic algorithm for constructing the dual representation of a polyhedral cone
      Alexander Kononov, Julia Memar and Yakov Zinder
      Scheduling with limited storage - a polynomial-time algorithm and efficient heuristics
      Nadezhda Maltugueva, Nikolay Pogodaev and Olga Samsonyuk
      Optimality conditions and numerical algorithms for hybrid systems
      Dmitry Gribanov and Dmitry Malishev
      Integer Conic Function Minimization Based on the Comparison Oracle
      Yulia Kovalenko and Aleksey Zakharov
      Pareto-based Hybrid Algorithms for the Bicriteria Asymmetric Travelling Salesman Problem
      Anna Panasenko
      A PTAS for One Cardinality-Weighted 2-Clustering Problem
      Olga Samsonuyk, Stepan Sorokin and Maxim Staritsyn
      Feedback Optimality Conditions with Weakly Invariant Functions for Nonlinear Problems of Impulsive Control
      Oleg Zaikin and Stepan Kochemazov
      Black-box optimization in an extended search space for SAT solving
      Vladimir Dykhta and Stepan Sorokin
      Feedback minimum principle for optimal control problems in discrete-time systems and its applications
      Fedor Stonyakin, Mohammad Alkousa, Alexander Titov and Victoria Piskunova
      On Some Methods for Strongly Convex Optimization Problems With One Functional Constraint
      Dmitry Khlopin
      General limit value for stationary Nash equilibrium
      Vladimir Berikov
      Semi-Supervised Classification Using Multple Clustering and Low-Rank Matrix Operations

      Corresponding authors of the listed papers are invited to upload camera-ready versions of their papers through Easychair until April 7, 2019.

      Please, login as a proceedings author and upload the files according to the instructions as follows:

      1. a zipped file containing all latex sources, images, and answers to the reviewers' comments; please, name this file paper-NNN.zip, where NNN is the number of your paper
      2. PDF version of your camera-ready paper
      3. scan-copy of the Copyright form, filled and signed by the corresponding author. The prefilled form you can download here.

      Please note that at least one author should participate in the conference and pay the registration fee in order to have your paper included in the proceedings.

      Communications in Computer and Information Science

      CCIS vol. 1090

      Accepted papers

      Natalia Aizenberg and Nikolai Voropai
      The interaction of consumers and load serving entity to manage electricity consumption
      Vladimir Erokhin
      Regularization and matrix correction of improper linear programming problems
      Chiang Kao
      Measuring the most favorable Russell efficiency under the framework of data envelopment analysis
      Adil Erzin and Roman Plotnikov
      The Convergecast Scheduling Problem on a Regular Triangular Grid
      Liudmila Prokudina and Dmitrii Bukharev
      Simulation of flow regimes of non-isothermal liquid films
      Elena Tabarintseva
      The accuracy of approximate solutions for a boundary value inverse problem with final overdetermination
      Polina Kononova and Igor Kulachenko
      The VNS Approach for a Consistent Capacitated Vehicle Routing Problem under the Shift Length Constraints
      Aigul Fabarisova and Vadim Kartak
      An integer programming approach to the irregular polyomino tiling problem
      Vladimir Servakh and Svetlana Malakh
      The net present value maximization in inventory management system
      Roman Plotnikov and Adil Erzin
      Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem
      Igor Kandoba and Alexander Uspenskiy
      On one applied problem of vector optimization
      Al'Fiya Surina and Alexander Tyrsin
      Vladimir Ushakov, Aleksandr Ershov and Maksim Pershakov
      Counterexamples in the Theory of α-Sets
      Gennady Zabudsky and Natalia Veremchuk
      On the One-Dimensional Space Allocation Problem with Partial Order and Forbidden Zones
      Evgenii Goncharov
      Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem
      Viktor Ukhobotov, Konstantin Kudryavtsev and Irina Stabulit
      On the problem of comparing fuzzy numbers
      Ivan Davydov and Daniil Tolstykh
      An evolution based approach for the traffic lights optimization problem
      Ushakov Vladimir and Lebedev Pavel
      Iterative methods for optimal packing approximations constructing for non convex polygons
      Tatiana Levanova and Alexander Gnusarev
      Development of Ant Colony Optimization Algorithm for Competitive p-Median Facility Location Problem with Elastic Demand
      Igor Vasilyev, Pasquale Avella, Maurizio Boccia and Sandro Viglione
      A local branching MIP heuristic for a real-world Curriculum-Based Course Timetabling Problem
      Alexander Kelmanov and Vladimir Khandeev
      The problem K-means and given J-centers: polynomial solvability in one dimension
      Inna Urazova, Ruslan Simanchev and Yury Kochetov
      Polyhedral attack on the graph approximation problem
      Leonid Popov
      Methods for matrix games with mixed strategies and quantile payoff function
      Lev Petrov
      Using Nonlinear Interactions To Control Oscillations Of Dynamic Systems
      Artem Ripatti and Vadim Kartak
      Bounds for non-IRUP instances of Cutting Stock Problem with minimal capacity
      Evgeni Nurminski and Natalia Shamray
      Discrete Time Lyapunov-Type Convergence Conditions for Recursive Sequences in Optimization
      Artyom Makovetskii, Sergei Voronin, Vitaly Kober and Aleksei Voronin
      A generalized point-to-point approach for orthogonal transformations
      Robert Namm and Georgiy Tsoy
      A modified duality scheme for solving 3D elastic problem with a crack
      Alexander Chentsov, Alexey Grigoryev and Alexey Chentsov
      Procedures of local optimization in routing problems with constraints
      Lidia Zaozerskaya
      Analysis of Integer Programming Model of Academic Load Distribution
      Alexander Semenov
      Merging variables: one technique of search in pseudo-Boolean optimization
      Timur Merembayev, Yedilkhan Amirgaliyev, Shahriar Shamiluulu and Didar Yedilkhan
      Using machine learning algorithm for diagnosis of stomach disorders
      Eugeniia Markova and Inna Sidler
      Optimization problem in an integral model of developing system without prehistory
      Igor Bykadorov
      Social Optimality in International Trade under Monopolistic Competition
      Anna Lempert, Alexander Kazakov and Quang Mung Le
      On the Thinnest Covering of Fixed Size Containers with Non-Euclidean Metric by Incongruent Circles
      Evgeniy A. Krupennikov
      On estimates of the solutions of inverse problems of optimal control
      Aleksandr Buldaev and Ivan Burlakov
      Iterative Method with Exact Fulfillment of Constraints in Optimal Control Problems
      Guzel Sharipzhanovna Shkaberina, Viktor Ivanovich Orlov, Elena Mikhailovna Tovbis and Lev Aleksandrovich Kazakovtsev
      Identification of the Optimal Set of Informative Features for the Problem of Separating a Mixed Production Batch of Semiconductor Devices for the Space Industry
      Yuri Kan and Sofia Vasil'Eva
      Deterministic approximation of stochastic programming problems with probabilistic constraints
      Anastasia Tavaeva, Dmitry Kurennov, Vladimir Krotov and Alexander Petunin
      A Cost Minimizing at Laser Cutting of Sheet Parts on CNC machines
      Anton Ushakov and Igor Vasilyev
      A computational comparison of parallel and distributed k-median clustering algorithms on large-scale image data
      Ovanes Petrosian and Anna Tur
      Hamilton-Jacobi-Bellman Equations for Non-cooperative Differential Games with Continuous Updating
      Olga Murav'Eva
      Matrix Correction of Inconsistent Systems of Linear Inequalities Using the Matrix l1 Norm
      Edward Kh. Gimadi and Ekaterina Shin
      On random MST problem with given diameter
      Hanan Shabana and Mikhail Volkov
      Using Sat solvers for synchronization issues in partial deterministic automata
      Aleksander Gornov, Tatiana Zarodnyuk, Anton Anikin and Pavel Sorokovikov
      The Stochastic Coverings Algorithm for Solving Applied Optimal Control Problems

      Corresponding authors of the listed papers are invited to upload camera-ready versions of their papers through Easychair until June 30, 2019.

      Please, login as a proceedings author and upload the files according to the instructions as follows:

      1. a zipped file containing all latex sources, images, and answers to the reviewers' comments; please, name this file paper-NNN.zip, where NNN is the number of your paper
      2. PDF version of your camera-ready paper
      3. scan-copy of the Copyright form, filled and signed by the corresponding author. The prefilled form you can download here.

      Please note that at least one author should participate in the conference and pay the registration fee in order to have your paper included in the proceedings.

      Special issues

      Papers significantly extending the results presented at the conference MOTOR 2019, or related papers, will be considered for peer-reviewed publication in special issues of the following journals:

      Impact Factor "1.631"

      Journal of Global Optimization

      The journal's impact factor is 1.631, it belongs to Q1 JCR Science Edition and Q1 Scopus SJR. The quality and topics of the submissions should correspond to the high standards of publications in JoGO and its Aims and Scope: here. The deadline for submission is November 1, 2019 January 10, 2020. Please, follow the journal's style and guidelines presented here. Manuscript submission must be made online via the journal's CMS. To specify the special issue, please choose “SI: MOTOR-19”.
      Guest Editors:
      Prof. Panos M. Pardalos - University of Florida, USA
      Prof. Michael Khachay - Krasovsky Institute of Mathematics and Mechanics
      Prof. Yury Kochetov - Sobolev Institute of Mathematics

      2018 Impact Factor "1.336"

      Optimization Methods & Software (OMS)

      The journal impact factor is 1.336, it belongs to Q2 JCR Science Edition, and the yearly best publication in OMS is awarded by the Charles Broyden prize. The quality and topics of the submissions should correspond to the high standards of publications in OMS and its Aims and Scope: here. The deadline for submission is November 1, 2019 January 19, 2020. Please, follow the journal's style and guidelines presented here. Manuscript submission must be made online via the journal's ScholarOne Manuscripts: site. To specify the special issue, please choose "MOTOR19".
      Guest Editors:
      Prof. Oleg Khamisov - Melentiev Energy Systems Institute
      Prof. Anton Eremeev - Sobolev Institute of Mathematics
      Prof. Vladimir Ushakov - Krasovsky Institute of mathematics and Mechanics

      Yugoslav Journal of Operations Research

      YUJOR - The Yugoslav Journal of Operations Research is an international journal dealing with all aspects of operations research, systems science, and management science. YUJOR publishes refereed papers describing significant results in the above areas whether theoretical or empirical, mathematical or descriptive. The journal is indexed by Scopus, it belongs to Q3 Scopus SJR. Authors guide can be found here, the papers should not exceed 23 pages, be presented in LaTeX according to the templates. Paper submission due is November 1, 2019 January 15, 2020. Making your submission, please specify the special issue "MOTOR 2019".
      Guest Editors:
      Prof. Leon Petrosyan - Saint-Petersburg State University
      Prof. Alexander Petunin - Ural Federal University
      Prof. Vadim Kartak - Ufa State Aviation Technical University

      Discrete Analysis and Operations Research

      The journal is published at the Sobolev Institute of Mathematics of SB RAS. The journal accepts original articles of theoretical or practical importance on the following topics of discrete analysis, operations research and computer science in Russian and English. The English translations of the articles are published in the Journal of Applied and Industrial Mathematics (Scopus Q2, JSR 0,292). The papers should not exceed 20–25 pages and send by e-mail: discopr@math.nsc.ru . Please, follow the journal's style and guidelines presented here. Making your submission, please specify the special issue "MOTOR 2019".
      Guest Editors:
      Prof. Evgeni A. Nurminski - Far Eastern Federal University

      Submission dates and instructions

      February 1
      Up to this date, we ask to register your talk using easychair conference account. This task is quite simple. The corresponding author is invited to log on to easychair, start a new submission and fill a form pointing out submission title, authors’ names, keywords and a short abstract in a plain text.
      February 15
      Up to this date, corresponding authors have an opportunity to edit all the information and upload (re-upload) their papers for possible inclusion to the conference proceedings, which will be published by Springer as volumes of LNCS and CCIS series
      November 1
      January 10, 2020
      Up to this date, all the authors are invited to submit their significantly elaborated papers presented on the conference or some another related papers to special issues of the peer-reviewed journals
      Note: full paper submission is not a necessary condition for participating in MOTOR 2019. To give a talk, it is sufficient to register it in easychair.


      Early bird (up to May 1)
      After May 2 or on site
      Student (undergraduate / graduate / PhD)
      50 eur
      60 eur
      100 eur
      125 eur

      Payment options: wire transfer to bank account of the conference co-organizer Visit Ural-Siberia Ltd., visa / mastercard online payment, by cash (on site)

      Registration fee grants an access to all sessions of the conference, publication the paper accepted to LNCS or CCIS, collective transfer to the conference venue (and return), and the conference kit

      In order to register, please send a message to the e-mail address motor2019.registr@gmail.com including the filled in Registration Form given below. Within three working days, you will receive a reply with the instructions on payment of?the registration fee.

      Registration form

      Please copy and paste this form to your message, fill it in and send it to motor2019.registr@gmail.com?with the Subject line "MOTOR 2019 Registration Form".
      1. Last name:
      2. Given name(s):
      3. Affiliation(s), including address(es):
      4. Citizenship:
      5. Are you a student (PhD student) (yes - please, enclose a scan-copy of your student ID card / no):
      6. ID(s) and title(s) of your papers(s), including all authors:
      7. Preferred way of payment (wire transfer (RUB / EUR), bank card online, cash (on site)):
      8. Do you need visa support (yes / no):
      9. Preferred type of entry visa (Business / Tourist):
      10. Do you need an invitation letter for your employer (electronic, hard copy, both, none):
      11. Any comments:


      Technical program



      The conference will be held in Obuhovsky resort (https://www.obuhovski.com), which is located in a picturesque place near Ekaterinburg, Russia, at the borderline between Europe and Asia. A number of single and twin rooms have been reserved and can be booked at special conference rates. Full board as well as some wellness services, such as gym or swimming pool with mineral water are included.

      The map of Obuhovsky resort:

      Accommodation types and prices:

      Room type
      Date of payment
      Cost per night (rubles)
      Total cost (rubles)

      single room or twin
      room for 1 person
      before 15th May 2019
      bed in a twin
      before 15th May 2019
      single room or twin
      room for 1 person
      after 15th May 2019
      bed in a twin
      after 15th May 2019

      Due to limited capacities, we encourage you to reserve well in advance. You can also make a reservation directly at https://www.obuhovski.com/prajs-list/.

      Room booking details:

      1. conference participants are invited to send a request to eni.obuhovski@mail.ru to issue the payment invoice for reservation.
      2. please, include to your request the following information: first name, last name, check-in date and time you prefer, check-out date and time, type of room (single or twin), contact phone number and e-mail to send the payment invoice;
      3. the e-mail response to the request will contain the payment invoice and billing information;
      4. each participant should pay the invoice and send a scanned copy of the receipt by e-mail at motor2019.registr@gmail.com;
      5. please keep your payment documents upon your arrival to the resort;
      6. All necessary payment confirmation documents can be issued upon request (an agreement, a participant certificate, acceptance certificate, receipt etc).

      The sightseeing tour:

      On July 10 at 10 a.m. a sightseeing tour will be held with a stop at monument at the border between Europe and Asia, a visit to the Ural Geological Museum and lunch at a Russian restaurant. The monument "Europe-Asia" is located at 13 km of the Moscow highway.

      The Ural Geological Museum was opened in 1937. It contains more than 40 thousand exhibits representing minerals, rocks and paleontological finds of the Ural region.

      Lunch is scheduled in the restaurant "Podkova", which is located in the center of Yekaterinburg at the address Lenina Avenue, 28/2, the menu in the attachment.

      Application for participation in the sightseeing tour must be submitted before July 1 at the conference email motor2019.registr@gmail.com.

      Local travel information:

      A local transfer is planned for registered participants:
       July 7, 2019 at 18:00 from the main building of Krasovsky Institute of Mathematics and Mechanics (IMM UB RAS) to the Obuhovsky resort
       July 12, 2019 at 14:00 from the Obuhovsky resort to the Koltsovo airport and the IMM UB RAS main building

      Local minibus transfers are also planned 8th through 11th July:
       at 8:00 from the IMM UB RAS main building to the Obuhovsky resort
       at 19:00 from the Obuhovsky resort to the IMM UB RAS main building

      Local time is GMT+5.
      Contact information of the Obuhovsky resort.

      棋牌抢庄牛牛 棋牌娱乐下载 斗牛牛下载
      微信斗地主赚钱 可以上分下分的牛牛 苹果手机斗牛牛赢现金 博游棋牌 大唐街棋牌 星力电玩打鱼 能赢钱的斗牛游戏 扎金花游戏下载官方 10元入场炸金花棋牌 捕鱼快手 开心娱乐棋牌 能兑换现金的捕鱼 两个人玩的斗地主游戏 绿茵棋牌 二八小九棋牌 捕鱼人民币提现 上分牛牛软件下载 手机游戏快乐炸金花 58元可以提现的炸金花 跑得快玩法