Wikipedia
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 for | Outstanding doctoral theses in the area of mathematical optimization |
| Country | United States |
| Presented by | Mathematical Optimization Society |
| Reward(s) | $1,000 |
| First awarded | 1988 |
Winners and finalists edit
- 1988:
- Andrew V. Goldberg for "Efficient graph algorithms for sequential and parallel computers".[1]
- 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:
- David Karger for "Random Sampling in Graph Optimization Problems".[4]
- Other Finalists: Jim Geelen and Luis Nunes Vicente
- 2000:
- Bertrand Guenin for his PhD thesis.
- Other Finalists: Kamal Jain and Fabian Chudak
- 2003:
- Tim Roughgarden for "Selfish Routing".[5]
- Other Finalists: Pablo Parrilo and Jiming Peng
- 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
- 2018:
- Yin Tat Lee for "Faster Algorithms for Convex and Combinatorial Optimization".[10]
- Other Finalists: Damek Davis and Adrien Taylor
- 2021:
- Jakub Tarnawski for "New Graph Algorithms via Polyhedral Techniques".[11]
- Other Finalists: Georgina Hall and Yair Carmon
See also edit
References edit
- ^ Date, Issue (August 8, 2005). Efficient graph algorithms for sequential and parallel computers. DSpace@MIT (Thesis). hdl:1721.1/14912. Retrieved December 25, 2017.
- ^ 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.
- ^ "David Williamson". The Mathematics Genealogy Project. April 4, 2017. Retrieved December 25, 2017.
- ^ "Random Sampling in Graph Optimization Problems" (MIT)
- ^ "Mathematical Optimization Society". Mathematical Optimization Society. Retrieved December 25, 2017.
- ^ "Decomposition and Sampling Methods for Stochastic Equilibrium Problems" (Mathematical Optimization Society)
- ^ "Mathematical Optimization Society". Mathematical Optimization Society. Retrieved December 25, 2017.
- ^ "Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs" (Mathematical Optimization Society)
- ^ "Integer Programming, Lattice Algorithms, and Deterministic Volume Computation" (Mathematical Optimization Society)
- ^ "A.W. Tucker Prize" (Mathematical Optimization Society)
- ^ "New Graph Algorithms via Polyhedral Techniques" (Mathematical Optimization Society)
External links edit
- Official web page (MOS)