<div dir="ltr">
<pre style="white-space:pre-wrap;color:rgb(0,0,0)"><font face="monospace, monospace">Folks,</font></pre><pre style="white-space:pre-wrap;color:rgb(0,0,0)"><font face="monospace, monospace">We're a bit late holding the election this year, which unfortunately is mostly my fault.</font></pre><pre style="white-space:pre-wrap;color:rgb(0,0,0)"><font face="monospace, monospace">Please fill out the ballot below and return it to the email address "election at <a href="http://coin-or.org">coin-or.org</a>". Ballots must be received by 24:00 (midnight) Eastern Daylight Time (UTC-4), Monday, March 13th, 2016. </font></pre><pre style="white-space:pre-wrap;color:rgb(0,0,0)"><font face="monospace, monospace">Election results will also be announced by email. Thank you for taking the time to vote for COIN-OR Directors!</font></pre><pre style="white-space:pre-wrap;color:rgb(0,0,0)"><font face="monospace, monospace">Bill Hart
Secretary, COIN-OR Foundation</font></pre><pre style="white-space:pre-wrap;color:rgb(0,0,0)"><font face="monospace, monospace">-----------------------------------------------------------------</font></pre><pre style="white-space:pre-wrap;color:rgb(0,0,0)"><font face="monospace, monospace"><br></font></pre><pre><font color="#000000" face="monospace, monospace"><span style="white-space:pre-wrap">COIN-OR Ballot
In each category below, you may vote for as many candidates as you like. The candidates receiving the most votes will be elected. Candidate statements appear immediately after the ballot.
Strategic Leadership Board
Three (3) to be elected. Type an X in the brackets '[ ]' to vote for a
candidate, or type in a name for a write-in vote. You may vote for as
many candidates as you like.
[ ] Matt Saltzman
[ ] Andrew Mason
[ ] Horand Gassmann
[ ] Write-in: _______________
Technical Leadership Council
Three (3) to be elected. Type an X in the brackets '[ ]' to vote for a
candidate. You may vote for as many candidates as you like.
[ ] Ted Ralphs
[ ] Write-in: _________________
[ ] Write-in: _________________
--------------------
Candidate Statements
--------------------
Horand Gassmann
---------------</span></font></pre><pre><font color="#000000" face="monospace, monospace"><span style="white-space:pre-wrap">Horand Gassmann is a Professor at the Rowe School of Business at Dalhousie University (Halifax, Canada). He received his Ph.D. in Commerce from the University of British Columbia. His major field of research is Stochastic Programming. He also has a long-standing interest in the development of formats for data interchange and was a co-developer of the SMPS format for stochastic linear programs. His involvement in COIN-OR development dates back to 2006, when he started contributing to the Optimization Services (OS) project. He is currently a co-manager of the OS project (along with Kipp Martin and Jun Ma).
<br></span></font></pre><pre><font color="#000000" face="monospace, monospace"><span style="white-space:pre-wrap">Andrew Mason
------------</span></font></pre><pre><font color="#000000" face="monospace, monospace"><span style="white-space:pre-wrap">
Andrew Mason is an Associate Professor at the University of Auckland where he teaches and publishes in Operations Research. In 2011, he drew on his experience of teaching with Excel to create OpenSolver, an open-source add-in for Excel that makes the COIN-OR solvers CBC, BonMin and Couenne available to a large world-wide user base. He has also developed SolverStudio which brings modelling languages, including the COIN-OR PuLP and Pyomo systems, to more advanced Excel users. He has many years experience distributing and supporting these systems through Wordpress web sites, experience which he has leveraged to help implement the new COIN-OR web site. He seeks to bring a Windows viewpoint to the COIN-OR initiative, and thereby help grow the user base for the COIN-OR software beyond the stereotypical Linux programmer.
Ted Ralphs
----------</span></font></pre><pre><font color="#000000" face="monospace, monospace"><span style="white-space:pre-wrap">
Ted Ralphs received his Ph.D. in Operations Research from Cornell University in 1995. He is currently a professor in the Department of Industrial and Systems Engineering (ISE) at Lehigh University, where he is director of the Laboratory for Computational Optimization Research at Lehigh (COR@L). He is a co-founder of the COIN-OR Foundation and is the current chair of the Technical Leadership Council, as well as a member of the Strategic Leadership Board and a project manager of a number of projects hosted in the COIN-OR open source software repository. His research interests include development of methodology for solving discrete optimization problems, including those with multiple levels or multiple objectives; development of parallel search algorithms; development of open source software; and applications of discrete optimization.</span></font></pre><pre><font color="#000000"><span style="white-space:pre-wrap"><font face="monospace, monospace">
Matthew Saltzman
----------------
Matthew Saltzman is Associate Professor of Mathematical Sciences at Clemson University. His research interests are in computational optimization -- particularly discrete optimization — and high-performance computing. He has been involved in COIN-OR since its inception in 2000 and is the founding president of the Foundation. He is the project manager of the OSI (Open Solver Interface) and QAPsolver projects, co-designer of CHiPPS, and a member of the development teams for CLP and CBC. He is an active INFORMS member, Chair of the INFORMS Computing Society, former editor-in-chief of INFORMS Online, and former VP for Information Technology.</font><br></span></font></pre></div>