Extended deadline: March 1, 2020
International conference
Mathematical Optimization Theory and Operations Research (MOTOR 2020)
July 6-10, 2020, Novosibirsk, Russia
http://math.nsc.ru/conference/motor/2020
Dear colleagues,
We invite you to take part at the international conference
"Mathematical Optimization Theory and Operations Research" (MOTOR 2020)
http://math.nsc.ru/conference/motor/2020
which will be held on July 6-10, 2020, near Novosibirsk Scientific Center, Russia,
at the Resort Hotel "Sosnovka" in a picturesque pine forest on the Ob River bay.
The aims of the conference is to bring together a wide research community in the fields
of mathematical programming and global optimization, discrete optimization, complexity theory
and combinatorial algorithms, games and their applications in relevant practical problems
of operations research, mathematical economy, and data analysis.
MOTOR 2020 is the annual international conference bringing together four well-known Russian
and international conferences 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 (Ekaterinburg);
• Discrete Optimization and Operations Research (Novosibirsk, Vladivostok);
• Optimization Problems and their Applications (Omsk).
The previous conference MOTOR 2019 was held on July 2019 near Ekaterinburg
http://motor2019.uran.ru
THE MAIN CONFERENCE TOPICS:
• theory of mathematical optimization
• integer programming and combinatorial optimization
• global optimization, stochastic integer programming, multi-objective programming
• computational complexity of combinatorial optimization problems
• approximation algorithms and schemes
• heuristics and metaheuristics for decision making and artificial intelligence
• game theory, mathematical economics, and multilevel programming
• optimization in machine learning and data analysis
• applications in operations research: scheduling, routing, facility location, packing and cutting, supply chain, etc.
PLENARY SPEAKERS
- Alexander Kostochka, University of Illinois at Chicago, USA
Long cycles in graph and hypergraphs
- Soumyendu Raha, Indian Institute of Science, Bangalore, India
Optimal complexity Matrix Multiplication like computation structures on
network-on-chip architecture subject to conflicts of resource allocation constraints
- Aida Abiad, Eindhoven University of Technology and Ghent University Netherlands
On graph invariants and their application to the graph isomorphism problem
- Bo Chen, University of Warwick, UK
Capacity Auctions: VCG Mechanism vs. Submodularity
- Sergei Chubanov, Bosch Research, Germany
Convex geometry in the context of artificial intelligence
- Igor Konnov Kazan Federal University, Russia
Equilibrium Formulations of Relative Optimization Problems
- Evripidis Bampis Sorbonne Universite, Paris, France
Multistage optimization problems
- Yakov Zinder, University of Technology Sydney Australia
Two-stage Scheduling Models with Limited Storage
- Panos Pardalos University Florida, USA
Inverse Combinatorial Optimization Problems
SPECIAL STREAMS
• Game theory
proposed by Vladimir Mazalov (Institute of Applied Mathematical Research of KRC RAS)
and Leon Petrosyan (Saint Petersburg State University)
• Theoretical and experimental analysis of metaheuristics
proposed by Maxim Buzdalov (ITMO University)
and Anton Eremeev (Sobolev Institute of Mathematics of SB RAS)
• Cutting and packing problems
proposed by Vadim Kartak (Ufa State Aviation Technical University)
and Alexander Petunin (Ural Federal University)
• Networks, machine learning and optimization
proposed by Valery Kalyagin (Higher School of Economics)
and Panos M. Pardalos (University of Florida)
• Optimization models in data science
proposed by Mikhail Khachay (Krasovsky Institute of Mathematics and Mechanics of UB RAS)
and Konstantin Vorontsov (Moscow Institute of Physics and Technology)
• Optimization Problems in Manufacturing and Supply Chain
proposed by Nenad Mladenovic (Khalifa University UAE)
• Industry applications
proposed by Alexander Kurochkin (Sobolev Institute of Mathematics of SB RAS)
IMPORTANT DATES
full paper submission: March 1, 2020 Extended deadline!
notification of acceptance: March 20, 2020
camera ready version: April 10, 2020
registration fee (100 euro): June 5, 2020
arrival at the hotel: July 5, 2020
conference dates: July 6-10, 2020
CHAIRS OF THE CONFERENCE
General chair: Vladimir Beresnev (Sobolev Institute of Mathematics, Russia)
Honorary chair Panos Pardalos (Florida, USA)
Program chairs: Alexander Kononov (Novosibirsk, Russia),
Mikhail Khachay (Ekaterinburg, Russia),
Valery Kalyagin (Higher School of Economics, Russia)
Organizing chair: Yury Kochetov (Sobolev Institute of Mathematics, Russia)
ABSTRACT AND PAPER SUBMISSION
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.
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, 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.
Authors can send abstract without paper for oral presentation.
PUBLICATION AND SPECIAL ISSUES
The conference proceedings are intended to be published by Springer 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 some high-level journals
to publish substantially extended versions of selected papers. The list of these journals will be
announced soon, at the conference site http://www.math.nsc.ru/conference/motor/2020/.
CONTACTS
Yury Kochetov
Organizing Committee MOTOR 2020
Sobolev Institute of Mathematics
E-mail: motor@math.nsc.ru
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* 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)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
