XI Summer School on Operations Research, Data, and Decision Making ORA 2019
XI Summer School on Operations Research, Data, and Decision Making,
ORA 2019, May 21-23, 2019.
Higher School of Economics, Nizhny Novgorod, Rodionova street 136, room 104
Higher School of Economics, Nizhny Novgorod.
The Summer School on Operational Research, Data and Decision Making will take place on May 21-23, 2019 in Nizhny Novgorod, Russia. The school is organized by
the Laboratory of Algorithms and Technologies for Networks Analysis and Faculty of Informatics, Mathematics and Computer Science of the National Research University Higher School of Economics, Nizhny Novgorod.
The main topics of the school are related to practical algorithms in logistics, transportation and traffic management, scheduling, decision science, and stochastic programming.
The school is hosted by the National Research University Higher School of Economics in Nizhny Novgorod. The school follows the tradition of previous summer schools on operational research and applications 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018:
The school is organized for last-year bachelor, master and PhD students. To attend the school as a participant you must register before May 5, 2019. Students are also encouraged to present the recent results of their research related to the topics of the summer school.
If you have any questions, please do not hesitate to contact us:
Registration / Abstract submission May 5 / April 15
Notification acceptance: Ad hoc
Summer School: May 21-23, 2019
Co-Chairs of the school
Alexander Dolgui, IMT Atlantique, Nantes, France,
Inverse Problems in Electromagnetism: Applications to Plasma Control in Nuclear Fusion Devices (PDF, 12.46 Mb)
Alexander Lazarev, Institute of Control Sciences of Russian Academy of Science, Moscow,
Approximation of objective function of the scheduling problem
Nenad Mladenovic, Emirates College of Technologies, Abu Dhabi, UAE,
Oleg Prokopyev, University of Pittsburg, USA and HSE,
Fractional 0–1 Programming: Applications, Complexity, Algorithms and Recent Advances (PDF, 58 Kb)
Yakov Zinder, University of Technology, Sydney, Australia,
Scheduling with Limited Storage: computational complexity, exact and approximation algorithms, polynomial-time approximation schemes
Andrey Savchenko, NRU HSE
Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!
To be used only for spelling or punctuation mistakes.