Shmuel Onn (Hebrew: שמואל און; born 1960) is a mathematician, Professor of Operations Research and Dresner Chair at the Technion - Israel Institute of Technology.

[3] Onn obtained his Ph.D. in operations research from Cornell University, with minors in applied mathematics and computer science, in 1992.

[7] Professor Onn has been also a long-term visitor at various mathematical research institutes including Mittag-Leffler in Stockholm, MSRI in Berkeley,[8] and Oberwolfach in Germany.

[3] Onn advised several students and postdoctoral researchers who proceeded to pursue academic careers, including Antoine Deza, Sharon Aviran, Tal Raviv, Nir Halman, and Martin Koutecký.

[23] [24][25][26][27][28] Some other contributions of Onn include a framework that uses edge-directions for solving convex multi-criteria combinatorial optimization problems and its applications,[29][30][31] a universality theorem showing that every integer program is one over slim three-dimensional tables,[32][33] the settling of the complexity of hypergraph degree sequences,[34] and the introduction of colorful linear programming.