ORSIS Award in the name of Uriel (Uri) Rothblum

The ORSIS Award in the name of Uriel (Uri) Rothblum was established by his family in 2013 for Excellent Work in Operations Research.

Uri was one of the outstanding scholars in Operations Research in Israel beginning in the early eighties until his untimely death in March 26, 2012. Uri contributed to many areas of Operations Research ranging from dynamic programming through game theory and matching problems to algebra and combinatorial optimization. He published about 150 articles in international journals, as well as two books. Uri was a member of many journal editorial boards and in particular was the editor-in-chief of the leading journal: Mathematics of Operations Research. Uri was the president of ORSIS from 2006 to 2008 and contributed greatly both to the OR society and to the field, ensuring continuation for the next generation. He was a professor at the Faculty of Industrial Engineering and Management at the Technion for three decades and served as its dean. He also served for several years as the Technion’s Executive Vice President for Academic Affairs.

As a continuation of his contribution to the field of Operations Research and in order to perpetuate the name of Uriel Rothblum, his family established this fund to encourage excellence in Operations Research.

Past Award Recipients:

  • 2020 – Eran Hanany, “Incomplete Information Games with Ambiguity Averse Players”
    (joint with Peter Klibanoff and Sujoy Mukerji)
  • 2019 – Shoham Sabach and Yakov Vaisbourd (joint with Jerome Bolte and Marc Teboulle),”First Order Methods Beyond Convexity and Lipschitz Gradient Continuity With Applications To Quadratic Inverse Problem”
  • 2018 – Niv Buchbinder and Moarn Fekdman, “Deterministic Algorithms for Submodular Maximization Problems”
  • 2017 – Dan Yamin, (joint with Forrest K. Jones, John P. DeVincenzo, Shai Gertler, Oren Kobiler, Jeffrey P. Townsend, and Alison P. Galvan), “Vaccination strategies against respiratory Syncytial virus”
  • 2016 – Tamar Cohen and Liron Yedidsion, “The Periodic Joint Replenishment Problem is Strongly NP-Hard”
  • 2015 – Amir Beck and Nadav Hallak, “On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions and Algorithms.”
  • 2015 –  Yair Shaki and Josh Reed, “A Fair Policy for the G/GI/N Queue with Multiple Server Pools.”
  • 2014 – Itai Gurvich, Junfei Huang and Avishai Mandelbaum, “Excursion-Based Universal Approximations for the Erlang-A Queue in Steady-State”.