| 2003 |
George Nicholson Student Paper Competition:
Honorable Mention
Winning material:
"Probabilistic Combinatorial Optimization: Moments, Order Statistics and Asymptotic Bounds"
|
|---|
Do you have the best O.R. department in the world? Enter to win the INFORMS Prize and find out.
View these presentations of verifiable O.R. practice success that made a substantial difference in their organizations. Use them in the classroom or to apply lessons learned to your own organization.
Call on INFORMS experts to comment on important news of the day in their expert areas.
