Beale–Orchard-Hays Prize

See the most recent call for nominations and the citation for the most recent winners . To be eligible for the Beale — Orchard-Hays Prize for Excellence in Computational Mathematical Programming, a paper or a book must meet the following requirements: Subject Area: It must be in the field of computational mathematical programming, which includes but is not limited to: Experimental evaluation of one or more mathematical programming algorithms. Development of quality mathematical programming software (i.e., well-documented code capable of solving an important class of mathematical programming problems) together with documentation of its application to this class of problems. (Note: the award is for the paper describing the work, not for the software itself.) Development of a new computational method that improves the state of the art in mathematical programming algorithm implementation, together with documentation of experiments demonstrating the improvement. Development of new methods for empirical testing of mathematical programming techniques (e.g., new designs for computational experiments, new performance measures, or methods that reduce the cost of empirical testing). Publication Requirements: It must have appeared in the open literature. Documentation must be written in a language acceptable to the Prize Committee. It must have been published during the six calendar years preceding the year in which the prize is awarded. The publication year is defined as the print publication year (for printed volumes) or the electronic publication year (for volumes appearing only electronically). These requirements serve as guidelines to the Prize Committee and are not binding when work of exceptional merit comes close to satisfying them. The MOS chair will appoint a Prize Committee of four to eight people, at least one year before the award date. Each committee member will read all nominations and provide assessments based on the judgment criteria. The Prize Committee may determine that no prize will be awarded for a given International Symposium on Mathematical Programming. The prize will be considered every three years. If awarded, it will be presented at the awards session of the International Symposium on Mathematical Programming. The prize consists of $1,500, and a plaque. Nominations will be judged based on: Magnitude of the contribution to the advancement of computational and experimental mathematical programming. Originality of ideas and methods. Degree to which unification or simplification of existing methodologies is achieved. Clarity and excellence of exposition. Nominations must be in writing and must include: Title(s) of the paper(s) or book Author(s) Place and date of publication Four copies of the material Supporting justification and supplementary materials are welcome but not required. All nominations must be received at least six months prior to the awards date. The Prize Committee reserves the right to request additional supporting materials from nominees. To see this year's nomination call please see this link Winner Bartolomeo Stellato Goran Banjac Paul Goulart Alberto Bemporad Stephen Boyd David Applegate Mateo Díaz Oliver Hinder Haihao Lu Miles Lubin Brendan O'Donoghue Warren Schudy Winner Alberto Costa Giacomo Nannicini Iain Dunning Joey Huchette Miles Lubin Winner Defeng Sun Kim-Chuan Toh Liuqin Yang Winner Stephen R. Becker Emmanuel J. Candès Michael C. Grant Winner Michael Grant Stephen Boyd Winner Tobias Achterberg Winner Nick Sahinidis Mohit Tawarmalanit Winner Elizabeth D. Dolan Robert Fourer Jorge J. Moré Todd S. Munson Winner David Applegate Bob Bixby Vasek Chvatal William Cook Winner Michael C. Ferris Steven P. Dirkse Winner Andrew Conn Nicholas I. M. Gould Philippe L. Toint Winner Irvin Lustig Roy Marsten David Shanno Winner Tony J. Van Roy Laurence Wolsey Winner Michael Saunders