International conference "Mathematical Optimization Theory and Operations Research" (MOTOR2019)
will be held on July 8-12, 2019, in the 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.
MOTOR2019 is a successor of the following well-known International and All-Russian conference series,
which were held in Ural, Siberia, and the Far East for a long time:
- Baikal International Triennial School Seminar on Methods of Optimization and Their Applications,
- Mathematical Programming and Applications http://mpa.imm.uran.ru/96/en
- Discrete Optimization and Operations Research http://www.math.nsc.ru/conference/door/2016/
- Optimization Problems and their Applications http://opta18.oscsbras.ru/en/
Having different origins, nowadays these conferences became very close to each other,
having much in common in their scientific topics, participants' community, and the organizers.
Therefore, this year the common Program committee decided to organize the joint conference
inheriting their long story and to name it Mathematical Optimization Theory and Operations Research (MOTOR).
Original research papers in all areas of optimization and its applications are solicited.
Along with theoretical results, submissions reporting on numerical algorithm benchmarking
or solution techniques for real-world operations research problems are welcomed as well.
Experimental and applied papers are expected to show convincingly the usefulness
and comparative efficiency of the algorithms discussed in a practical setting.
The main conference topics include, but not limited to
- 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.
abstract submission due: February 1, 2019
full paper submission due: February 15, 2019
notification of acceptance: March 15, 2019
camera ready version: April 2, 2019
conference dates: July 8-12, 2019
Prof. Vadim Levit, Ariel University. Israel
Prof. Alexander Grigoriev, Maastricht University, Netherlands
Prof. Natalia Shachlevich, University of Leeds, UK
Prof. Angelo Sifaleras, University of Macedonia, Greece
Prof. Vitaly Strusevich, University of Greenwich, UK
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 according to the LaTeX templates
can have 12-15 pages and submitted in PDF. Please, follow the official Springer authors guidelines
All papers should be submitted through the easychair conference management system
Publication and Special Issues:
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.
After the conference, it is planned to organize special issues of two-three high-level journals
to publish substantially extended versions of selected papers.
The list of these journals will be announced at the conference site http://motor2019.uran.ru
Early bird (up to May 1st) Regular 100 eur and 125 eur on site
Student (undergraduate / graduate / PhD) 50 eur and 60 eur on site
Sobolev Institute of Mathematics
Pr. Akademika Koptyuga,4
630090, Novosibirsk, Russia
Phone: +7 383 329-75-83
Fax: +7 383 333-25-98
* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)