Tucker Prize

The Tucker Prize for outstanding theses in the area of optimization is sponsored by the Mathematical Optimization Society (MOS). Up to three finalists are presented at each (triennial) International Symposium of the MOS. The winner will receive an award of $1000 and a certificate. The Albert W. Tucker Prize was approved by the Society in 1985, and was first awarded at the Thirteenth International Symposium on Mathematical Programming in 1988.

Tucker Prize
Awarded forOutstanding doctoral theses in the area of mathematical optimization
Country United States
Presented byMathematical Optimization Society
Reward(s)$1,000
First awarded1988

Winners and finalists
  • 1988:
  • 1991:
    • Michel Goemans for "Analysis of Linear Programming Relaxations for a Class of Connectivity Problems".[2]
    • Other Finalists: Leslie Hall and Mark Hartmann
  • 1994:
    • David P. Williamson for "On the Design of Approximation Algorithms for a Class of Graph Problems".[3]
    • Other Finalists: Dick Den Hertog and Jiming Liu
  • 1997:
  • 2000:
    • Bertrand Guenin for his PhD thesis.
    • Other Finalists: Kamal Jain and Fabian Chudak
  • 2003:
  • 2006:
    • Uday V. Shanbhag for "Decomposition and Sampling Methods for Stochastic Equilibrium Problems".[6]
    • Other Finalists: José Rafael Correa and Dion Gijswijt
  • 2009:
    • Mohit Singh for "Iterative Methods in Combinatorial Optimization".[7]
    • Other Finalists: Tobias Achterberg and Jiawang Nie
  • 2012:
    • Oliver Friedmann for "Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs".[8]
    • Other Finalists: Amitabh Basu and Guanghui Lan
  • 2015:
    • Daniel Dadush for "Integer Programming, Lattice Algorithms, and Deterministic Volume Computation".[9]
    • Other Finalists: Dmitriy Drusvyatskiy and Marika Karbstein

See also

References
  1. Date, Issue (August 8, 2005). Efficient graph algorithms for sequential and parallel computers. DSpace@MIT (Thesis). hdl:1721.1/14912. Retrieved December 25, 2017.
  2. Date, Issue (May 28, 2004). "Analysis of Linear Programming Relaxations for a Class of Connectivity Problems". DSpace@MIT. hdl:1721.1/5195. Retrieved December 25, 2017.
  3. "David Williamson". The Mathematics Genealogy Project. April 4, 2017. Retrieved December 25, 2017.
  4. "Random Sampling in Graph Optimization Problems" (MIT)
  5. "Mathematical Optimization Society". Mathematical Optimization Society. Retrieved December 25, 2017.
  6. "Decomposition and Sampling Methods for Stochastic Equilibrium Problems" (Mathematical Optimization Society)
  7. "Mathematical Optimization Society". Mathematical Optimization Society. Retrieved December 25, 2017.
  8. "Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs" (Mathematical Optimization Society)
  9. "Integer Programming, Lattice Algorithms, and Deterministic Volume Computation" (Mathematical Optimization Society)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.