Home | Contact | About MOS | Membership | Publications | Prizes | Meetings | IPCO | ISMP | Links | Album | Jobs
Mathematical Optimization Society


IPCO 2019 will be held at U Michigan at Ann Arbor, organized by Jon Lee and Viswanath Nagarajan. PC Chair: Andrea Lodi (02/2018)

MPC announces Best Paper in 2017 (01/2018)

New issue of Optima: 103 (09/2017)

Call for Nominations: Dantzig Prize 2018 (08/2017)

Call for Nominations: Lagrange Prize 2018 (08/2017)

Call for Nominations: Paul Y. Tseng Memorial Lectureship 2018 (08/2017)

Call for nominations: Tucker Prize 2018 (08/2017)

Call for nominations: Beale — Orchard-Hays Prize 2018 (08/2017)

Call for nominations: Fulkerson Prize 2018 (07/2017)

Call for site pre-proposals: ISMP 2021 (07/2017)

More News

Nominations for 2015 Elections

This web page lists candiates for the MOS elections 2015, each including a short biosketch.

Candidates for MOS chair

Karen Aardal

Professor of Optimization, Delft University of Technology.

My main research interest is integer programming, and in particular algebraic approaches to integer programming. I am also interested in combinatorial optimization, in particular in facility location. In terms of applications I am currently involved in a large Dutch project aiming at improving all aspects of ambulance planning, and in a European project on the design of electricity networks.

Optimization plays an ever important role in society, industry, and science. In all these areas there are problems that call for provably good formulations and solution methods. The links and relations to other areas of science offer exciting grounds for new developments. Since the very beginning, MOS has played a key role in establishing and organizing activities to the benefit of the development and dissemination of mathematical optimization. I would truly enjoy serving as the chair of the society, and strive to continue this tradition. For MOS, I have been a Council Member-at-large, the Publications Committee Chair, and the Chair of the Executive Committee. This year I also served as chair for the A.W. Tucker Prize jury. I have served on the board of Mathematical Programming Series B since 2000.

Ekkehard Sachs

Ekkehard Sachs, University of Trier (Germany), has been a participant in activities of MOS for almost four decades. He graduated from the Technical University in Darmstadt (Germany) in 1975 has held positions in Europe in Darmstadt, at the Technical University Berlin and in Trier, but also in North America at North Carolina State University and Virginia Tech. Furthermore, he was a visiting professor at Rice University and the University of California Merced. His scientific interests lie in numerical and theoretical optimization and its connection to applications in various fields. He has served on the editorial board of the Mathematical Programming Journal, Series B, for several years.

He is convinced that the interplay of the fields of continuous, discrete and stochastic optimization will be an important focus of the future research of mathematical optimization and an important part in its applications to numerous scientific fields. Especially, the area of model-driven or model-based optimization requires the use of tools from all different areas of optimization. MOS will play a central role in trying to achieve progress in these goals through its conferences and journals.

Candidates for MOS treasurer

Marina Epelman

Marina Epelman received her undergraduate degree from Cornell University, and her PhD from the MIT Operations Research Center. She has been a faculty member at the Industrial and Operations Engineering department at the University of Michigan since 1999. Marina's research includes applications of optimization models and algorithms in a variety of fields, such as healthcare and scheduling, and methodological work in convex and infinite-dimensional optimization. She had served as a secretary and treasurer of INFORMS Optimization Society and of SIAM Activity Group on Optimization, and has been the organizer of many invited sessions and optimization clusters at ISMP, SIOPT and INFORMS meetings.

Oktay Günlük

Oktay is the manager of the Mathematical Optimization and Algorithms group at IBM Research. He has received his BS and MS degrees from Bogazici University and his PhD degree from IEOR Department at Columbia University. After obtaining his degree, he was a visiting researcher at CORE at the Universite catholique de Louvain and at Cornell University, and then joined the Operations Research Group at AT&T Labs. He has moved to IBM Research in 2000. Oktay's research lies in the area of integer programming and discrete optimization. He is an associate editor of Networks, Math. Programming Computation, Operations Research and has served on the editorial board of MOS/SIAM Book Series on Optimization (2008-2014). He has been on the program committee for MIP (2006, 2007), IPCO (2010,2011), and ISCO (2014). He was the chair of organizing committee for IPCO 2011 and in this capacity has handled the conference finances. He has also served as the vice chair for Integer Programming of the INFORMS Optimization Society (2009-2011).

Candidates for MOS Council

Shabbir Ahmed

Shabbir Ahmed is the Dean's Professor and Stewart Faculty Fellow at the School of Industrial & Systems Engineering at Georgia Tech. His research interests are in stochastic and integer programming. Dr. Ahmed served as the Chair of the Stochastic Programming Society (SPS) for the term 2007-2010 and led the initiative to define SPS as a Technical Section of MOS. He serves on the editorial boards of the MOS journals Mathematical Programming A and Mathematical Programming C, and as guest editor for two Mathematical Programming B Special issues. He has also served as the Stochastic Optimization co-Cluster Chair for the past several ISMP Conferences.

Roberto Cominetti

Roberto Cominetti graduated as Mathematical Engineer from Universidad de Chile in 1986 and received a PhD in Applied Mathematics from Universite Blaise Pascal (Clermontt II) in 1989. He developed his career at the Universidad de Chile, first at the Department of Mathematical Engineering and more recently at the Department of Industrial Engineering. His main research interests are in convex optimization and algorithmic game theory as well as their applications to equilibrium and dynamics in transportation networks. He has published over 50 papers and has been invited as plenary speaker at several international conferences including the 47th Australia - New Zealand Industrial & Applied Mathematics Conference (2011), the 23rd International Conference on Game Theory (2012), the 8th Triennal Symposium on Transportation Analysis (2013), as well as a semi-plenary talk in the forthcoming 22nd International Symposium on Mathematical Programming (ISMP'2015). He served in the Editorial Board of Mathematical Programming for the period 1997-2000, as well in the Program Committee of the 1st International Conference on Continuous Optimization (ICCOPT'2004) and the 19th International Symposium on Mathematical Programming (ISMP'2006).

Frank E. Curtis

Frank E. Curtis is a Frank Hook Assistant Professor in the Department of Industrial and Systems Engineering at Lehigh University, where he has been employed since 2009. He received his Bachelors degree from the College of William and Mary in 2003 with a double major in Mathematics and Computer Science, received his Masters in 2004 and Ph.D. in 2007 from the Department of Industrial Engineering and Management Science at Northwestern University, and spent two years as a Postdoctoral Researcher in the Courant Institute of Mathematical Sciences at New York University from 2007 until 2009. His research focuses on the design of numerical methods for solving large-scale nonlinear optimization problems, the results of which have appeared in journals such as Mathematical Programming and the SIAM Journal on Optimization. He received an Early Career Award from the Advanced Scientific Computing Research program at the U.S. Department of Energy, as well as funding from the Computational Mathematics Program at the U.S. National Science Foundation. He was the Vice Chair for Nonlinear Programming for the INFORMS Optimization Society from 2010 until 2012.

Samuel Fiorini

Samuel Fiorini is a faculty member of Universite libre de Bruxelles (ULB, Brussels) in the Department of Mathematics and Computer Science Department. He has held research positions at CWI, MIT and GERAD - HEC Montreal. His research focusses on combinatorial optimization, and in particular polyhedral combinatorics and approximation algorithms. He is the principal investigator of the ERC grant FOREFRONT, focussing on extended formulations.

Jacek Gondzio

Jacek obtained his PhD in Automatic Control and Robotics from Warsaw University of Technology in 1989. He held a research position at the Systems Research Institute of the Polish Academy of Sciences and two visiting positions: at the University of Paris IX Dauphine in 1990-1991 and at the University of Geneva in 1993-1998. Since 1998, he has been at the School of Mathematics at the University of Edinburgh. His research interests include the theory and implementation of algorithms for very large-scale optmization. He is best known for his contributions in the area of interior point methods. He is a member of the editorial board of Mathematical Programming Computation.

Adrian Lewis

Adrian Lewis is a Professor in Cornell's School of Operations Research and Information Engineering, where he completed a three-year term as Director in 2013. His research on nonsmooth optimization and variational analysis has been recognized in the 1995 Aisenstadt Prize from the CRM in Montreal, the 2003 Lagrange Prize from MOS and SIAM, and a 2005 Outstanding Paper Prize from SIAM. He is a SIAM Fellow, and he was an invited section speaker at the 2014 International Congress of Mathematicians. His editorial board service has included the MOS-SIAM Series on Optimization, and since 2005 he has been a Co-Editor of Mathematical Programming, Series A.

Frauke Liers

Frauke Liers received her Diplom in mathematics (1999) and her PhD in computer science (2004) from the University of Cologne, Germany. After long-term research stays at the Istituto di Analisi dei Sistemi ed Informatica, Rome, and the Laboratoire de Physique Theorique et Modeles Statistiques, Paris, she was awarded a five-year grant of the German Science Foundation within the Emmy Noether Programme. In this programme, young researchers lead their own junior research group. Frauke obtained her Habilitation in 2010 from the University of Cologne. In 2012, she joined the Department of Mathematics of the FAU Erlangen-Nuremberg, Germany, as a Professor. Frauke's research focuses on design, analysis, and implementation of exact methods for discrete mathematical optimization problems with applications in operations research and the natural sciences. She is PI in several third-party funded projects including the Collaborative Research Center TRR 154. She is member of the Editorial Board of Mathematical Methods of Operations Research and joined MOS in 2007.

Marc Pfetsch

Marc Pfetsch is full professor for Discrete Optimization at TU Darmstadt, Germany. After finishing his studies in 1997 at Heidelberg University, he went to Cornell University for one year with a Fulbright grant. In 1998, he started his Ph.D. studies at TU Berlin. After receiving his Ph.D. in 2002, he became a postdoctoral researcher at Zuse Institute Berlin. Starting 2008, he had been head of the integer programming group and has been involved in the development of branch-and-cut framework SCIP since then. In 2008, he obtained the habilitation and became full professor at TU Braunschweig. His research interests are integer and combinatorial optimization. In particular, this centers around symmetries, coloring problems, and compressed sensing. Since 2014, he serves as associate editor of Operations Research Letters and technical editor for MPC since 2009. He has also served as the MOS web editor since 2007 and was responsible for the web redesign of the web pages in 2009 and the MOS logo in 2011.