Call for nomination of the 2018 Beale — Orchard-Hays Prize
Nominations are invited for the 2018 Beale — Orchard-Hays Prize for Excellence in
Computational Mathematical Programming.
The Prize is sponsored by the Mathematical Optimization Society, in memory of
Martin Beale and William Orchard-Hays, pioneers in computational mathematical
programming. Nominated works must have been published between Jan 1, 2012 and
Dec 31, 2017, and demonstrate excellence in any aspect of computational
mathematical programming. "Computational mathematical programming"
includes the development of high-quality mathematical programming algorithms and
software, the experimental evaluation of mathematical programming algorithms,
and the development of new methods for the empirical testing of mathematical
programming techniques. Full details of prize rules and eligibility requirements
can be found here.
The members of the 2018 Beale — Orchard-Hays Prize committee are:
- Michael Grant (Chair), CVX Research
- Tobias Achterberg, Gurobi Optimization
- Jeff Linderoth, University of Wisconsin
- Petra Mutzel, University of Dortmund
- Ted Ralphs, Lehigh University
Nominations can be submitted electronically or in writing, and should include
detailed publication details of the nominated work. Electronic submissions
should include an attachment with the final published version of the nominated
work. If done in writing, submissions should include five copies of the
nominated work. Supporting justification and any supplementary material are
strongly encouraged but not mandatory. The Prize Committee reserves the right to
request further supporting material and justification from the nominees.
The deadline for nominations is
February 15, 2018.
Nominations should be submitted to:
Dr. Michael Grant, firstname.lastname@example.org
If you wish to submit a nomination in writing, please contact Dr. Grant
for a mailing address.
Previous winners of the Beale — Orchard-Hays Prize are
listed here. Further information about the
Beale — Orchard-Hays Prize can be found here.